12 search results - page 1 / 3 » The Parameterized Complexity of Some Geometric Problems in U... |
IWPEC
2009
Springer
13 years 11 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...
COLT
1993
Springer
13 years 8 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
ESA
2003
Springer
13 years 9 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ECCV
2002
Springer
14 years 6 months ago
2002
Springer
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
SIAMIS
2011
12 years 11 months ago
2011
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...