186 search results - page 20 / 38 » Decidable Extensions of Church's Problem |
144
click to vote
ATVA
2010
Springer
15 years 2 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
134
Voted
IANDC
2011
14 years 8 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
94
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
110
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Although camera self-calibration and metric reconstruction have been extensively studied during the past decades, automatic metric reconstruction from long video sequences with va...
143
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...