Sciweavers

263 search results - page 8 / 53
» Rigid Tree Automata
Sort
View
RP
2009
Springer
124views Control Systems» more  RP 2009»
14 years 2 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez
FCT
2007
Springer
14 years 1 months ago
Complexity of Pebble Tree-Walking Automata
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
Mathias Samuelides, Luc Segoufin
AMW
2011
12 years 11 months ago
A Direct Translation from XPath to Nondeterministic Automata
Since navigational aspects of XPath correspond to first-order definability, it has been proposed to use the analogy with the very successful technique of translating LTL into aut...
Nadime Francis, Claire David, Leonid Libkin
ICCV
2011
IEEE
12 years 7 months ago
Simultaneous Correspondence and Non-Rigid 3D Reconstruction of the Coronary Tree from Single X-ray Images
We present a novel approach to simultaneously reconstruct the 3D structure of a non-rigid coronary tree and estimate point correspondences between an input X-ray image and a refer...
Eduard Serradell (Institut de Robotica i Informati...