1222 search results - page 79 / 245 » Some Results on Directable Automata |
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper a new rectification method is proposed. The method is both simple and efficient and can deal with all possible camera motions. A minimal image size without any pixel...
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In cast-shadow analysis one merely draws a line between each occluder and its associated shadow cast onto a different surface, possibly with wedges indicating precision. In some c...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
ICCAD
1993
IEEE
15 years 2 months ago
1993
IEEE
Current approaches to compute and exploit the flexibility of a component in an FSM network are all at the symbolic level [23, 30, 33, 31]. Conventionally, exploitation of this ï¬...