Sciweavers

1672 search results - page 51 / 335
» Tightness problems in the plane
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Robust plane-based structure from motion
We introduce a new approach to structure and motion recovery directly from one or more large planes in the scene. When such a plane exists, we demonstrate how to automatically det...
Zihan Zhou, Hailin Jin, Yi Ma
FOCS
2009
IEEE
14 years 3 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
14 years 2 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang
RSS
2007
151views Robotics» more  RSS 2007»
13 years 10 months ago
Predicting Partial Paths from Planning Problem Parameters
— Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter p...
Sarah Finney, Leslie Pack Kaelbling, Tomás ...
EOR
2006
104views more  EOR 2006»
13 years 8 months ago
A factor 1/2 approximation algorithm for two-stage stochastic matching problems
We introduce the two-stage stochastic maximum-weight matching problem and demonstrate that this problem is NP-complete. We give a factor 1 2 approximation algorithm and prove its ...
Nan Kong, Andrew J. Schaefer