2467 search results - page 206 / 494 » Finite State Machines |
194
click to vote
AIMSA
2006
Springer
15 years 10 months ago
2006
Springer
Although speech and language processing techniques achieved a relative maturity during the last decade, designing a spoken dialogue system is still a tailoring task because of the ...
168
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
162
click to vote
COLING
1992
15 years 7 months ago
1992
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
164
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
For decades, Hidden Markov Models (HMMs) have been the state-of-the-art technique for acoustic modeling despite their unrealistic independence assumptions and the very limited rep...
189
Voted
ENTCS
2006
15 years 6 months ago
2006
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...