985 search results - page 143 / 197 » Piercing Convex Sets |
CCCG
2010
13 years 10 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
NIPS
1998
13 years 10 months ago
1998
We present a method for learning complex appearance mappings, such as occur with images of articulated objects. Traditional interpolation networks fail on this case since appearan...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
ENDM
2008
13 years 9 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...