10493 search results - page 457 / 2099 » Dynamic Word Problems |
184
click to vote
IPL
2002
15 years 6 months ago
2002
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
182
click to vote
TALG
2010
15 years 5 months ago
2010
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
259
click to vote
CPM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
199
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper focuses on the problem of word detection and recognition in natural images. The problem is significantly more challenging than reading text in scanned documents, and h...
197
click to vote
ICRA
2003
IEEE
16 years 3 days ago
2003
IEEE
−−−− The simultaneous localization and mapping (SLAM) with detection and tracking of moving objects (DATMO) problem is not only to solve the SLAM problem in dynamic environ...