73 search results - page 6 / 15 » Path Compression in Timed Automata |
PACT
2005
Springer
14 years 29 days ago
2005
Springer
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
FOIKS
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
BNCOD
2004
13 years 9 months ago
2004
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
IVC
2002
13 years 7 months ago
2002
This paper addresses the problem of automatically extracting frequently used pedestrian pathways from video sequences of natural outdoor scenes. Path models are learnt from the ac...
STRINGOLOGY
2008
13 years 9 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...