2188 search results - page 318 / 438 » Instance-Optimal Geometric Algorithms |
121
click to vote
MICS
2010
15 years 1 months ago
2010
We introduce a framework for the construction, maintenance, and manipulation of arrangements of curves embedded on certain two-dimensional orientable parametric surfaces in three-d...
142
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
170
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
138
click to vote
ANCS
2005
ACM
15 years 8 months ago
2005
ACM
New network applications like intrusion detection systems and packet-level accounting require multi-match packet classification, where all matching filters need to be reported. Te...
160
click to vote
SIGGRAPH
1997
ACM
15 years 7 months ago
1997
ACM
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...