Sampling-based dimension reduction for subspace approximation
From MaRDI portal
Publication:3549665
DOI10.1145/1250790.1250884zbMath1232.68172OpenAlexW2113238413MaRDI QIDQ3549665
Amit Deshpande, Kasturi R. Varadarajan
Publication date: 5 January 2009
Published in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1250790.1250884
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Related Items (12)
One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ Identifying an unknown code by partial Gaussian elimination ⋮ Efficient subspace approximation algorithms ⋮ Matrix Rigidity from the Viewpoint of Parameterized Complexity ⋮ On the complexity of matrix rank and rigidity ⋮ Fast subspace approximation via greedy least-squares ⋮ Column subset selection via sparse approximation of SVD ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient Construction of Rigid Matrices Using an NP Oracle
This page was built for publication: Sampling-based dimension reduction for subspace approximation
