Efficient Volume Sampling for Row/Column Subset Selection
暂无分享,去创建一个
[1] Avner Magen,et al. Near Optimal Dimensionality Reductions That Preserve Volumes , 2008, APPROX-RANDOM.
[2] Claude-Pierre Jeannerod,et al. Essentially optimal computation of the inverse of generic polynomial matrices , 2005, J. Complex..
[3] Santosh S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, SODA '06.
[4] Alan M. Frieze,et al. Fast monte-carlo algorithms for finding low-rank approximations , 2004, JACM.
[5] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[6] GuMing,et al. Efficient algorithms for computing a strong rank-revealing QR factorization , 1996 .
[7] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[8] Santosh S. Vempala,et al. Spectral Algorithms , 2009, Found. Trends Theor. Comput. Sci..
[9] Severnyi Kavkaz. Pseudo-Skeleton Approximations by Matrices of Maximal Volume , 2022 .
[10] S. Goreinov,et al. The maximum-volume concept in approximation by low-rank matrices , 2001 .
[11] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[12] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[13] S. Goreinov,et al. Pseudo-skeleton approximations by matrices of maximal volume , 1997 .
[14] C. Pan. On the existence and computation of rank-revealing LU factorizations , 2000 .
[15] Christos Boutsidis,et al. An improved approximation algorithm for the column subset selection problem , 2008, SODA.
[16] Y. Peres,et al. Determinantal Processes and Independence , 2005, math/0503110.
[17] S. Muthukrishnan,et al. Relative-Error CUR Matrix Decompositions , 2007, SIAM J. Matrix Anal. Appl..
[18] Ming Gu,et al. Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..
[19] Malik Magdon-Ismail,et al. On selecting a maximum volume sub-matrix of a matrix and related problems , 2009, Theor. Comput. Sci..
[20] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[21] R. Lyons. Determinantal probability measures , 2002, math/0204325.
[22] Malik Magdon-Ismail,et al. Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix , 2011, Algorithmica.