3750 search results - page 170 / 750 » Timed Automata Patterns |
147
click to vote
ENTCS
2008
15 years 6 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
155
click to vote
ENTCS
2006
15 years 6 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
206
click to vote
IPL
2008
15 years 6 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
200
click to vote
ACCV
2007
Springer
16 years 20 days ago
2007
Springer
This paper describes a method that accelerates pattern matching. The distance between a pattern and a window is usually close to the distance of the pattern to the adjacement windo...
191
click to vote
ICDM
2006
IEEE
16 years 15 days ago
2006
IEEE
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...