The Mailman algorithm: a note on matrix-vector multiplication
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5764801 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- An Algorithm for the Computation of Linear Forms
- An extended set of FORTRAN basic linear algebra subprograms
- An improved algorithm for Boolean matrix multiplication
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Basic Linear Algebra Subprograms for Fortran Usage
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Extending the four Russians' bound to general matrix multiplication
- Extensions of Lipschitz mappings into a Hilbert space
- Gaussian elimination is not optimal
- Matrix-vector multiplication in sub-quadratic time (some preprocessing required)
- On the Number of Multiplications Required for Matrix Multiplication
- On the number of multiplications necessary to compute certain functions
Cited in
(10)- Learning the truth vector in high dimensions
- Feasibility checking in Horn constraint systems through a reduction based approach
- Matrix-vector multiplication in sub-quadratic time (some preprocessing required)
- Faster algorithms for weighted recursive state machines
- Efficient methods for grouping vectors into low-rank clusters
- Detecting low-rank clusters via random sampling
- Dense fast random projections and Lean Walsh transforms
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Real-valued embeddings and sketches for fast distance and similarity estimation
- On geometric prototype and applications
This page was built for publication: The Mailman algorithm: a note on matrix-vector multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976066)
