Sampling-based dimension reduction for subspace approximation

We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th

• Type: Conference
• Year: 2007
• Where: STOC
• Authors: Amit Deshpande, Kasturi R. Varadarajan
• Keywords: Algorithms, Randomized Bi-criteria Algorithm, STOC 2007