1672 search results - page 117 / 335 » Tightness problems in the plane |
152
click to vote
FOCS
2006
IEEE
15 years 12 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
170
click to vote
IOR
2007
15 years 5 months ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
155
click to vote
JMIV
2010
15 years 18 days ago
2010
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments a...
161
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
177
click to vote
SWAT
1998
Springer
15 years 10 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...