Viterbi algorithm
Viterbi algorithm
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
The Viterbi algorithm is a dynamic programming algorithm that finds the most likely sequence of hidden events that would explain a sequence of observed events. The result of the algorithm is often called the Viterbi path. It is most commonly used with hidden Markov models (HMMs).
Excerpt from the Wikipedia article “Viterbi algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Viterbi algorithm to your collection.
Play for free



