Backward Algorithm
The Backward Algorithm is a dynamic programming method used in the context of Hidden Markov Models that computes the probability of observing the remaining sequence of events from a given time step onward, conditioned on being in a particular hidden state at that time, by recursively propagating backward through the sequence.
358
Publications
44.6K
Citations
859
Authors
455
Institutions
Publications per year
2017–2026
92
Variants
Backward Procedure
Parents
358
Speech parameter generation algorithms for HMM-based speech synthesis
Keiichi Tokuda, Takayoshi Yoshimura, Takashi Masuko et al. · 2002 · 1K citations
1–5 of 358
859
7
h-index
6
h-index
6
h-index
4
h-index
4
h-index
1–5 of 859
455

Centre National de la Recherche Scientifique
Paris, France
13 h-index
24 publications
1.8K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
17 publications
1.3K citations

Ton Duc Thang University
Ho Chi Minh City, Vietnam
7 h-index
10 publications
239 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
7 h-index
18 publications
430 citations
Duy Tan University
Da Nang, Vietnam
6 h-index
10 publications
241 citations
Korea Advanced Institute of Science and Technology
Daejeon, South Korea
6 h-index
9 publications
307 citations

Vietnam National University Ho Chi Minh City
Ho Chi Minh City, Vietnam
6 h-index
10 publications
241 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
9 publications
616 citations
1–8 of 455
13 publications · 707 citations
13
h-index
8 publications · 280 citations
8
h-index
MCOM · 5 publications · 83 citations
5
h-index
5 publications · 167 citations
5
h-index
5 publications · 145 citations
5
h-index
1–5