Statistical properties of community structure in large social and information networks
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
SIAM Journal on Computing
Proceeding of the 17th international conference on World Wide Web - WWW ’08
Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC ’13
Petros Drineas
Ravi Kannan
Jure Leskovec
Anirban Dasgupta
Xiangrui Meng
Kevin J. Lang
Matrix Sketching Over Sliding Windows
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Uncovering the Small Community Structure in Large Networks
Beating CountSketch for heavy hitters in insertion streams
Continuous matrix approximation on distributed data