Algorithms and Hardness for Subspace Approximation.
Amit DeshpandeMadhur TulsianiNisheeth K. VishnoiPublished in: SODA (2011)
Keyphrases
- significant improvement
- optimization problems
- computational complexity
- computational cost
- orders of magnitude
- theoretical analysis
- learning algorithm
- learning theory
- error bounds
- times faster
- computational efficiency
- benchmark datasets
- worst case
- constraint satisfaction problems
- computationally efficient
- np complete
- feature space
- data structure
- approximation algorithms
- data mining