503 search results - page 36 / 101 » Probabilistic Weighted Automata |
128
click to vote
CSL
2002
Springer
15 years 2 months ago
2002
Springer
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...
138
click to vote
ETFA
2008
IEEE
15 years 9 months ago
2008
IEEE
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
118
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
103
click to vote
ICANN
2003
Springer
15 years 8 months ago
2003
Springer
Many activity dependent learning rules have been proposed in order to model long-term potentiation (LTP). Our aim is to derive a spike time dependent learning rule from a probabili...
102
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...