Pages that link to "Item:Q4238529"
From MaRDI portal
The following pages link to Approximating Matrix Multiplication for Pattern Recognition Tasks (Q4238529):
Displaying 10 items.
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation (Q413911) (← links)
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication (Q598219) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Design and analysis of bipartite experiments under a linear exposure-response model (Q2681751) (← links)
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method (Q3654439) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds (Q5251753) (← links)
- Randomized numerical linear algebra: Foundations and algorithms (Q5887823) (← links)
- A literature survey of matrix methods for data science (Q6068265) (← links)
- Optimal sampling algorithms for block matrix multiplication (Q6100583) (← links)