6 search results - page 1 / 2 » On approximating the smallest enclosing Bregman Balls |
66
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
ESA
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
CCCG
2010
14 years 11 months ago
2010
Let
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...