Sampling-based dimension reduction for subspace approximation
- 11 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 641-650
- https://doi.org/10.1145/1250790.1250884
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Improved Approximation Algorithms for Large Matrices via Random ProjectionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- How to get close to the median shapePublished by Association for Computing Machinery (ACM) ,2006
- Adaptive Sampling and Fast Low-Rank Matrix ApproximationLecture Notes in Computer Science, 2006
- Coresets forWeighted Facilities and Their ApplicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- High-Dimensional Shape Fitting in Linear TimeDiscrete & Computational Geometry, 2004
- Projective clustering in high dimensions using core-setsPublished by Association for Computing Machinery (ACM) ,2002
- Fast computation of low rank matrix approximationsPublished by Association for Computing Machinery (ACM) ,2001