Projective clustering in high dimensions using core-sets
Proceedings of the eighteenth annual symposium on Computational geometry
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
Polynomial-time approximation of largest simplices in V-polytopes
Discrete Applied Mathematics
Inner and outer approximations of polytopes using boxes
Computational Geometry: Theory and Applications
Efficient subspace approximation algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Convex sets as prototypes for classifying patterns
Engineering Applications of Artificial Intelligence
Minimal containment under homothetics: a simple cutting plane approach
Computational Optimization and Applications
No dimension independent core-sets for containment under homothetics
Proceedings of the twenty-seventh annual symposium on Computational geometry
Construction of convex hull classifiers in high dimensions
Pattern Recognition Letters
Algorithms and hardness for subspace approximation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Note: A note on approximation of a ball by polytopes
Discrete Optimization
| Hi-index | 0.00 |