Sciweavers

2467 search results - page 144 / 494
» Finite State Machines
Sort
View
NAACL
2010
15 years 4 months ago
Formatting Time-Aligned ASR Transcripts for Readability
We address the problem of formatting the output of an automatic speech recognition (ASR) system for readability, while preserving wordlevel timing information of the transcript. O...
Maria Shugrina
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 11 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 6 months ago
Persistent Queries
act state machines. (To make that discussion self-contained, we include a summary of this material before the modifications.) Fortunately, only rather minor modifications are neede...
Andreas Blass, Yuri Gurevich
TOOLS
2000
IEEE
15 years 11 months ago
Pickling Threads State in the Java System
Today, distributed object-based computing is closely linked with Java. The Java virtual machine is ported to most current operating systems and provides many services which help d...
Sara Bouchenak, Daniel Hagimont
FUIN
2006
84views more  FUIN 2006»
15 years 6 months ago
Nondeterministic Bimachines and Rational Relations with Finite Codomain
Bimachines are important conceptual tools used for the characterization of rational word functions (realized by single-valued transducers). Despite the attention received in the pa...
Nicolae Santean, Sheng Yu