Approximating Matrix Multiplication for Pattern Recognition Tasks
From MaRDI portal
Publication:4238529
Recommendations
- scientific article; zbMATH DE number 4104408
- Fast rectangular matrix multiplication and applications
- On low-complexity approximation of matrices
- scientific article; zbMATH DE number 2185645
- Fast computation of low rank matrix approximations
- Matrix methods in data mining and pattern recognition
- scientific article; zbMATH DE number 5161643
- scientific article; zbMATH DE number 69567
- On practical algorithms for accelerated matrix multiplication
- Fast rectangular matrix multiplication and some applications
Cited in
(13)- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- Design and analysis of bipartite experiments under a linear exposure-response model
- Importance sampling for a Monte Carlo matrix multiplication algorithm, with application to information retrieval
- Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Randomized numerical linear algebra: Foundations and algorithms
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- A literature survey of matrix methods for data science
- Optimal sampling algorithms for block matrix multiplication
- Improving compressed matrix multiplication using control variate method
- Multiplication of 0-1 matrices via clustering
This page was built for publication: Approximating Matrix Multiplication for Pattern Recognition Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238529)
