100 search results - page 9 / 20 » Closure and factor-critical graphs |
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
SIGMOD
2005
ACM
14 years 1 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...