Sciweavers

245 search results - page 25 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
COLING
1996
13 years 9 months ago
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alterna...
Edmund Grimley-Evans, George Anton Kiraz, Stephen ...
ISLPED
1997
ACM
104views Hardware» more  ISLPED 1997»
13 years 11 months ago
Composite sequence compaction for finite-state machines using block entropy and high-order Markov models
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). B...
Radu Marculescu, Diana Marculescu, Massoud Pedram
FPL
1999
Springer
147views Hardware» more  FPL 1999»
14 years 5 days ago
Synthia: Synthesis of Interacting Automata Targeting LUT-based FPGAs
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
SAC
2004
ACM
14 years 1 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
BPM
2007
Springer
152views Business» more  BPM 2007»
14 years 2 months ago
Towards Dynamic Matching of Business-Level Protocols in Adaptive Service Compositions
In a service composition, it is necessary to ensure that the behaviour of a constituent service is consistent with the requirements of the composition. In an adaptive service compo...
Alan W. Colman, Linh Duy Pham, Jun Han, Jean-Guy S...