Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Projective clustering in high dimensions using core-sets
Proceedings of the eighteenth annual symposium on Computational geometry
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Coresets for polytope distance
Proceedings of the twenty-fifth annual symposium on Computational geometry
L2-SVM training with distributed data
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
An online core vector machine with adaptive MEB adjustment
Pattern Recognition
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
ACM Transactions on Algorithms (TALG)
Streaming algorithms for extent problems in high dimensions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating parameterized convex optimization problems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Ordinal-class core vector machine
Journal of Computer Science and Technology
No dimension independent core-sets for containment under homothetics
Proceedings of the twenty-seventh annual symposium on Computational geometry
New approximation algorithms for minimum enclosing convex shapes
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part I)
Computational Geometry: Theory and Applications
Minimal enclosing discs, circumcircles, and circumcenters in normed planes (Part II)
Computational Geometry: Theory and Applications
Ball ranking machines for content-based multimedia retrieval
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
On approximating the Riemannian 1-center
Computational Geometry: Theory and Applications
Fast k-clustering queries on embeddings of road networks
Proceedings of the 3rd International Conference on Computing for Geospatial Research and Applications
Reduced universal background model for speech recognition and identification system
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Approximating parameterized convex optimization problems
ACM Transactions on Algorithms (TALG)
Training sparse SVM on the core sets of fitting-planes
Neurocomputing
Fast and robust approximation of smallest enclosing balls in arbitrary dimensions
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |
Given a set of points P@?R^d and value @e0, an @e-core-setS@?P has the property that the smallest ball containing S has radius within 1+@e of the radius of the smallest ball containing P. This paper shows that any point set has an @e-core-set of size @?1/@e@?, and this bound is tight in the worst case. Some experimental results are also given, comparing this algorithm with a previous one, and with a more powerful, but slower one.