Fast computation of low-rank matrix approximations
Fast computation of low rank matrix approximations
Database-friendly random projections
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Journal of Computer and System Sciences
Journal of the ACM
Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC ’01
Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS ’01
Frank Mcsherry
Matrix Sketching Over Sliding Windows
Very sparse stable random projections for dimension reduction in l? (0 <? ? 2) norm
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Fast monte-carlo algorithms for finding low-rank approximations
Beating CountSketch for heavy hitters in insertion streams
Uncertainty principles, extractors, and explicit embeddings of l2 into l1