3874 search results - page 203 / 775 » Approximation Algorithms for k-hurdle Problems |
119
click to vote
FAW
2008
Springer
15 years 5 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
132
click to vote
KI
2007
Springer
15 years 3 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
126
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
144
click to vote
ECCV
2000
Springer
15 years 8 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
164
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...