Near Optimal Column-Based Matrix Reconstruction
暂无分享,去创建一个
Christos Boutsidis | Petros Drineas | Malik Magdon-Ismail | Christos Boutsidis | Petros Drineas | M. Magdon-Ismail | P. Drineas
[1] Per Christian Hansen,et al. Some Applications of the Rank Revealing QR Factorization , 1992, SIAM J. Sci. Comput..
[2] Ming Gu,et al. Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..
[3] Alan M. Frieze,et al. Clustering in large graphs and matrices , 1999, SODA '99.
[4] Prabhakar Raghavan,et al. Competitive recommendation systems , 2002, STOC '02.
[5] Alan M. Frieze,et al. Fast monte-carlo algorithms for finding low-rank approximations , 2004, JACM.
[6] Daniel B. Szyld,et al. The many proofs of an identity on the norm of oblique projections , 2006, Numerical Algorithms.
[7] Santosh S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, SODA '06.
[8] Tamás Sarlós,et al. Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[9] S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, ACM-SIAM Symposium on Discrete Algorithms.
[10] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[11] Kasturi R. Varadarajan,et al. Efficient Subspace Approximation Algorithms , 2007, Discrete & Computational Geometry.
[12] Per-Gunnar Martinsson,et al. Randomized algorithms for the low-rank approximation of matrices , 2007, Proceedings of the National Academy of Sciences.
[13] Kasturi R. Varadarajan,et al. Sampling-based dimension reduction for subspace approximation , 2007, STOC '07.
[14] Gene H. Golub,et al. Numerical methods for solving linear least squares problems , 1965, Milestones in Matrix Computation.
[15] Mark Tygert,et al. A Randomized Algorithm for Principal Component Analysis , 2008, SIAM J. Matrix Anal. Appl..
[16] David P. Woodruff,et al. Numerical linear algebra in the streaming model , 2009, STOC '09.
[17] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[18] Christos Boutsidis,et al. An improved approximation algorithm for the column subset selection problem , 2008, SODA.
[19] Nikhil Srivastava,et al. Twice-ramanujan sparsifiers , 2008, STOC '09.
[20] Luis Rademacher,et al. Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[21] David P. Woodruff,et al. Coresets and sketches for high dimensional subspace approximation problems , 2010, SODA '10.
[22] D. Spielman,et al. Spectral sparsification and restricted invertibility , 2010 .
[23] Michael Langberg,et al. A unified framework for approximating and clustering data , 2011, STOC '11.
[24] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[25] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[26] Anastasios Zouzias,et al. A Matrix Hyperbolic Cosine Algorithm and Applications , 2011, ICALP.
[27] Christos Boutsidis,et al. Faster Subset Selection for Matrices and Applications , 2011, SIAM J. Matrix Anal. Appl..