Sampling-based dimension reduction for subspace approximation

DOI10.1145/1250790.1250884zbMATH Open1232.68172OpenAlexW2113238413MaRDI QIDQ3549665FDOQ3549665

Authors: Amit Deshpande, Kasturi 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

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (13)

• Identifying an unknown code by partial Gaussian elimination
• Title not available (Why is that?)
• One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
• Efficient Construction of Rigid Matrices Using an NP Oracle
• Title not available (Why is that?)
• On the complexity of matrix rank and rigidity
• Column subset selection via sparse approximation of SVD
• Matrix Rigidity from the Viewpoint of Parameterized Complexity
• Fast subspace approximation via greedy least-squares
• New subset selection algorithms for low rank approximation: offline and online
• Data reduction for weighted and outlier-resistant clustering
• Sampling-based dimension reduction for subspace approximation with outliers
• Efficient subspace approximation algorithms

This page was built for publication: Sampling-based dimension reduction for subspace approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549665)