Sciweavers

503 search results - page 7 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
CCCG
2008
14 years 11 months ago
The Solution Path of the Slab Support Vector Machine
Given a set of points in a Hilbert space that can be separated from the origin. The slab support vector machine (slab SVM) is an optimization problem that aims at finding a slab (...
Joachim Giesen, Madhusudan Manjunath, Michael Eige...
88
Voted
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
13 years 9 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
APVIS
2006
14 years 11 months ago
Polygon labelling of minimum leader length
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectan...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
70
Voted
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
14 years 9 months ago
On Metric Clustering to Minimize the Sum of Radii
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...
CCCG
2008
14 years 11 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...