7006 search results - page 605 / 1402 » Approximation Algorithms |
180
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
250
click to vote
DCOSS
2008
Springer
15 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
210
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper describes a visual odometry algorithm for estimating frame-to-frame camera motion from successive stereo image pairs. The algorithm differs from most visual odometry...
342
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
145
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...