For hidden Markov model (HMM) based speech recognition where the basic speech unit is smaller than the recognizer's output unit, the standard full Baum-Welch re-estimation procedure for the HMM training is very costly in computation. This is hecause it requires evaluation of the HMM output densities
โฆ LIBER โฆ
On the completeness of an identifiability algorithm for semi-Markovian models
โ Scribed by Yimin Huang; Marco Valtorta
- Book ID
- 106343080
- Publisher
- Springer Netherlands
- Year
- 2008
- Tongue
- English
- Weight
- 703 KB
- Volume
- 54
- Category
- Article
- ISSN
- 1012-2443
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The semi-relaxed algorithm for estimatin
โ
Li Deng
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 489 KB
On the completeness and supercompletenes
โ
G. V. Nikitov
๐
Article
๐
2009
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 209 KB
On the completeness of a model of statis
โ
Bach Hu'ng Khang
๐
Article
๐
1978
๐
Elsevier Science
โ 784 KB
An Algorithm for Isolating the Real Solu
โ
Bican Xia; Lu Yang
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 298 KB
We propose an algorithm for isolating the real solutions of semi-algebraic systems, which has been implemented as a Maple-program realzero. The performance of realzero in solving some examples from various applications is presented and the timings are reported.
An Algorithm for Identifying the Degrada
โ
S. B. Benevolenskii; A. A. Lisov
๐
Article
๐
2005
๐
Springer US
๐
English
โ 46 KB
On some algorithms for the solution of t
โ
V.N. Kublanovskaya
๐
Article
๐
1962
๐
Elsevier Science
โ 955 KB