Fetching the paper…
Reading the bibliography…
We adapt a well known streaming algorithm for approximating item frequencies to the matrix sketching setting.
Finding repeated elements
Jayadev Misra and David Gries · 1982
Earlier work this paper cites.
Latent semantic indexing: a probabilistic analysis
Christos H. Papadimitriou, Hisao Tamaki, Prabhakar Raghavan, and Santosh Vempala · 1998
Earlier work this paper cites.
Fast monte-carlo algorithms for finding low-rank approximations
Alan Frieze, Ravi Kannan, and Santosh Vempala · 1998
Earlier work this paper cites.
Database-friendly random projections
Dimitris Achlioptas · 2001
Earlier work this paper cites.
Strong converse for identification via quantum channels
Rudolf Ahlswede and Andreas Winter · 2002
Earlier work this paper cites.
Frequency estimation of internet packet streams with limited space
Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro · 2002
Earlier work this paper cites.
Finding frequent items in data streams
Moses Charikar, Kevin Chen, and Martin Farach-Colton · 2002
Earlier work this paper cites.
Pass efficient algorithms for approximating large matrices, 2003
Petros Drineas and Ravi Kannan · 2003
Earlier work this paper cites.
Pass efficient algorithms for approximating large matrices
Petros Drineas and Ravi Kannan · 2003
Earlier work this paper cites.
A simple algorithm for finding frequent elements in streams and bags
Richard M. Karp, Scott Shenker, and Christos H. Papadimitriou · 2003
Cited alongside, same era.
The Random Projection Method
S. S. Vempala · 2004
Cited alongside, same era.
Group-theoretic algorithms for matrix multiplication
Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, and Christopher Umans · 2005
Cited alongside, same era.
A fast random sampling algorithm for sparsifying matrices
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2006
Cited alongside, same era.
Improved approximation algorithms for large matrices via random projections
Tamas Sarlos · 2006
Cited alongside, same era.
Adaptive sampling and fast low-rank matrix approximation
Amit Deshpande and Santosh Vempala · 2006
Cited alongside, same era.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Later among the works it cites.
An improved approximation algorithm for the column subset selection problem
Christos Boutsidis, Michael W. Mahoney, and Petros Drineas · 2009
Later among the works it cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Later among the works it cites.
Feature hashing for large scale multitask learning
Kilian Weinberger, Anirban Dasgupta, John Langford, Alex Smola, and Josh Attenberg · 2009
Later among the works it cites.
Sums of random hermitian matrices and an inequality by rudelson
Roberto Imbuzeiro Oliveira · 2010
Later among the works it cites.
Spectral norm of products of random and deterministic matrices
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fast computation of low-rank matrix approximations
Dimitris Achlioptas and Frank Mcsherry · 2007
Cited alongside, same era.
Randomized algorithms for the low-rank approximation of matrices
Edo Liberty, Franco Woolfe, Per-Gunnar Martinsson, Vladimir Rokhlin, and Mark Tygert · 2007
Cited alongside, same era.
A note on sums of independent random matrices after ahlswede-winter
Roman Vershynin
Cited in the paper.
Roman Vershynin · 2010
Later among the works it cites.
Faster least squares approximation
Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Tamas Sarlos · 2011
Later among the works it cites.
Near optimal column-based matrix reconstruction
Christos Boutsidis, Petros Drineas, and Malik Magdon-Ismail · 2011
Later among the works it cites.