244 search results - page 13 / 49 » Generalized RANSAC Framework for Relaxed Correspondence Prob... |
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
MP
1998
13 years 7 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
SCIA
2007
Springer
14 years 1 months ago
2007
Springer
The problem of reconstructing 3D scene features from multiple views with known camera motion and given image correspondences is considered. This is a classical and one of the most...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
AIPS
2007
13 years 9 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...