Sciweavers

1275 search results - page 87 / 255
» The Infinite Hidden Markov Model
Sort
View
NAACL
2004
15 years 14 days ago
Catching the Drift: Probabilistic Content Models, with Applications to Generation and Summarization
We consider the problem of modeling the content structure of texts within a specific domain, in terms of the topics the texts address and the order in which these topics appear. W...
Regina Barzilay, Lillian Lee
ICASSP
2011
IEEE
14 years 2 months ago
EM-style optimization of hidden conditional random fields for grapheme-to-phoneme conversion
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ï...
Georg Heigold, Stefan Hahn, Patrick Lehnen, Herman...
ICML
2006
IEEE
15 years 12 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
TSP
2008
106views more  TSP 2008»
14 years 11 months ago
An EM Algorithm for Ion-Channel Current Estimation
Parameter estimation of a continuous-time Markov chain observed through a discrete-time memoryless channel is studied. An expectation-maximization (EM) algorithm for maximum likeli...
William J. J. Roberts, Yariv Ephraim
77
Voted
ICASSP
2009
IEEE
15 years 5 months ago
Combining mixture weight pruning and quantization for small-footprint speech recognition
Semi-continuous acoustic models, where the output distributions for all Hidden Markov Model states share a common codebook of Gaussian density functions, are a well-known and prov...
David Huggins-Daines, Alexander I. Rudnicky