37 search results - page 4 / 8 » Smallest Enclosing Cylinders |
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
CCCG
1998
13 years 9 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
SODA
2003
ACM
13 years 9 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...
CCCG
2008
13 years 9 months ago
2008
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 (...
JAIR
2010
13 years 6 months ago
2010
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...