Subject
Statistics, Probability and Uncertainty,Statistics and Probability
Reference16 articles.
1. Achlioptas, D., McSherry, F., 2001. Fast computation of low rank matrix approximations. In: STOC’01: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 611–618
2. Alon, N., Krivelevich, M., Vu, V.H., On the concentration of eigenvalues of random symmetric matrices. Tech. Report 60, Microsoft Research, 2000
3. A fast random sampling algorithm for sparsifying matrices;Arora;APPROX-RANDOM,2006
4. Using linear algebra for intelligent information retrieval;Berry;SIAM Review,1995
5. Bar-Yossef, Z., 2003. Sampling lower bounds via information theory. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, USA, pp. 335–344