Viterbi

From Cohen Courses
Revision as of 00:29, 28 March 2011 by Dwijaya (talk | contribs) (Created page with 'The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states that results in a sequence of observed events. [http://en.wikiped…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states that results in a sequence of observed events.

External link

Relevant Papers

Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=Viterbi&oldid=4653"