Sciweavers

1246 search results - page 207 / 250
» Recursive Timed Automata
Sort
View
CSL
2002
Springer
15 years 2 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
TCS
2002
15 years 1 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
GLOBECOM
2010
IEEE
15 years 9 days ago
Cache-Based Scalable Deep Packet Inspection with Predictive Automaton
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...
Yi Tang, Junchen Jiang, Xiaofei Wang, Yi Wang, Bin...
TC
2010
14 years 9 months ago
Generating Reliable Code from Hybrid-Systems Models
Hybrid systems have emerged as an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. Under this paradigm, distr...
Madhukar Anand, Sebastian Fischmeister, Yerang Hur...
ICML
2006
IEEE
16 years 3 months ago
Learning hierarchical task networks by observation
Knowledge-based planning methods offer benefits over classical techniques, but they are time consuming and costly to construct. There has been research on learning plan knowledge ...
Negin Nejati, Pat Langley, Tolga Könik