245 search results - page 19 / 49 » Using Finite State Automata for Sequence Mining |
DAC
1994
ACM
13 years 12 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
KBSE
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...