49 search results - page 9 / 10 » Finite State Transducers Approximating Hidden Markov Models |
145
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together f...
154
click to vote
NN
1997
Springer
15 years 10 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
164
click to vote
CORR
2011
Springer
15 years 26 days ago
2011
Springer
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
159
click to vote
ISM
2008
IEEE
16 years 7 days ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
200
click to vote
ACL
2008
15 years 7 months ago
2008
Accurate unsupervised learning of phonemes of a language directly from speech is demonstrated via an algorithm for joint unsupervised learning of the topology and parameters of a ...