The Mailman algorithm: a note on matrix-vector multiplication

DOI10.1016/j.ipl.2008.09.028zbMath1191.68832OpenAlexW1973089001MaRDI QIDQ976066

Edo Liberty, Steven W. Zucker

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.028

zbMATH Keywords

algorithmsmatrix-vector multiplicationrandom projectionsMailman algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (9)

Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ Dense fast random projections and Lean Walsh transforms ⋮ Detecting low-rank clusters via random sampling ⋮ Faster Algorithms for Weighted Recursive State Machines ⋮ On Geometric Prototype and Applications ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Efficient methods for grouping vectors into low-rank clusters ⋮ Learning the truth vector in high dimensions ⋮ Feasibility checking in Horn constraint systems through a reduction based approach

Uses Software

• BLAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved algorithm for Boolean matrix multiplication
• Extending the four Russians' bound to general matrix multiplication
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Gaussian elimination is not optimal
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Extensions of Lipschitz mappings into a Hilbert space
• An extended set of FORTRAN basic linear algebra subprograms
• An Algorithm for the Computation of Linear Forms
• On the Number of Multiplications Required for Matrix Multiplication
• Basic Linear Algebra Subprograms for Fortran Usage
• On the number of multiplications necessary to compute certain functions

This page was built for publication: The Mailman algorithm: a note on matrix-vector multiplication