Efficient Subspace Approximation Algorithms
Open Access
- 11 November 2011
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 47 (1), 44-63
- https://doi.org/10.1007/s00454-011-9384-2
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Sampling-based dimension reduction for subspace approximationPublished by Association for Computing Machinery (ACM) ,2007
- Sampling algorithms for l2 regression and applicationsPublished by Association for Computing Machinery (ACM) ,2006
- Matrix approximation and projective clustering via volume samplingPublished 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
- Fast monte-carlo algorithms for finding low-rank approximationsJournal of the ACM, 2004
- Continuous location of dimensional structuresEuropean Journal of Operational Research, 2004
- A note on the robustness of multivariate mediansStatistics & Probability Letters, 1999
- Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spacesMathematical Programming, 1993
- Algebraic optimization: The Fermat-Weber location problemMathematical Programming, 1990