205 search results - page 15 / 41 » Pruning 2-Connected Graphs |
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, a geometric approach for global selflocalization based on a world-model and active stereo vision is introduced. The method uses class specific object recognition a...
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
UAI
2004
13 years 8 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...