Sciweavers

1672 search results - page 147 / 335
» Tightness problems in the plane
Sort
View
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
15 years 11 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
DAM
2006
132views more  DAM 2006»
14 years 11 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
FOCS
2004
IEEE
15 years 2 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
ICCV
2009
IEEE
16 years 4 months ago
Piecewise Planar Stereo for Image-based Rendering
We present a novel multi-view stereo method designed for image-based rendering that generates piecewise planar depth maps from an unordered collection of photographs. First a di...
Sudipta N. Sinha, Drew Steedly and Richard Szelisk...
ICDE
2008
IEEE
140views Database» more  ICDE 2008»
16 years 17 days ago
Top-k Spatial Joins of Probabilistic Objects
Probabilistic data have recently become popular in applications such as scientific and geospatial databases. For images and other spatial datasets, probabilistic values can capture...
Vebjorn Ljosa, Ambuj K. Singh