Publication:4471374
From MaRDI portal
zbMath1092.68660MaRDI QIDQ4471374
Kenneth L. Clarkson, Mihai Bădoiu
Publication date: 28 July 2004
68T10: Pattern recognition, speech recognition
Related Items
Approximate minimum enclosing balls in high dimensions using core-sets, Analysis of incomplete data and an intrinsic-dimension Helly theorem, Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center, Streaming and dynamic algorithms for minimum enclosing balls in high dimensions, Streaming with minimum space: an algorithm for covering by two congruent balls, Minimal containment under homothetics: a simple cutting plane approach, Efficient approximation algorithms for clustering point-sets, Minimum-volume enclosing ellipsoids and core sets, Dynamic coresets, Practical methods for shape fitting and kinetic data structures using coresets, No dimension-independent core-sets for containment under homothetics, A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Faster core-set constructions and data-stream algorithms in fixed dimensions, Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere