Fast monte-carlo algorithms for finding low-rank approximations
Latent Semantic Indexing: A Probabilistic Analysis
Kernels as features: On kernels, margins, and low-dimensional mappings
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
An algorithmic theory of learning: Robust concepts and random projection
Latent semantic indexing
Machine Learning
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Proceedings of the ACM SIGCOMM 2008 conference on Data communication - SIGCOMM ’08
Journal of Computer and System Sciences
Journal of the ACM
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC ’95
Hisao Tamaki
Christos H. Papadimitriou
Prabhakar Raghavan
Avrim Blum
Prasad Chalasani
Daniel Dadush
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
(Gap/S)ETH hardness of SVP
How Well Can Congestion Pricing Neutralize Denial of Service Attacks?