Approximating Matrix Multiplication for Pattern Recognition Tasks

DOI10.1006/jagm.1998.0989zbMath0923.68110OpenAlexW2608151934MaRDI QIDQ4238529

David D. Lewis, Edith Cohen

Publication date: 30 March 1999

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.0989

zbMATH Keywords

pattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (10)

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 ⋮ Design and analysis of bipartite experiments under a linear exposure-response model ⋮ 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 ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ Sparsified Randomization Algorithms for large systems of linear equations and a new version of the Random Walk on Boundary method ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds

This page was built for publication: Approximating Matrix Multiplication for Pattern Recognition Tasks