Author:
Krauthgamer Robert,Sapir Shay
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference28 articles.
1. Arora, S., Hazan, E., Kale, S.: A fast random sampling algorithm for sparsifying matrices. In: Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques, pp. 272–279. Springer, New York (2006). https://doi.org/10.1007/11830924_26
2. Achlioptas, D., Karnin, Z.S., Liberty, E.: Near-optimal entrywise sampling for data matrices. In: Advances in Neural Information Processing Systems, pp. 1565–1573 (2013). https://proceedings.neurips.cc/paper/2013/hash/6e0721b2c6977135b916ef286bcb49ec-Abstract.html
3. Achlioptas, D., McSherry, F.: Fast computation of low-rank matrix approximations. J ACM (JACM) 54(2), 9-es (2007). https://doi.org/10.1145/1219092.1219097
4. Bakshi, A, Clarkson, K.L., Woodruff, D.P.: Low-rank approximation with 1/$$\epsilon $$$${}^{\text{1/3}}$$ matrix-vector products. In: 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1130–1143 (2022). https://doi.org/10.1145/3519935.3519988
5. Graduate Texts in Mathematics;R Bhatia,1997