Sciweavers

APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
14 years 2 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale