Revision as of 01:25, 27 August 2005 edit Cadillac (talk \| contribs) 2,415 edits mNo edit summary ← Previous edit		Revision as of 14:12, 29 August 2005 edit undo Ruud Koot (talk \| contribs) 31,416 edits →Extensions: see also Next edit →
Line 73: An alternate algorithm, called the Lazy Viterbi algorithm, has been recently proposed. This works by not expanding any nodes until it really needs to, and usually manages to get away with doing a lot less work (in software) than the ordinary Viterbi algorithm for the same result - however, it is not so easy to parallelize in hardware. ==See also== * [[Baum Welch algorithm]] * [[Hidden Markov model]] * [[Linear error-correcting code]] ==References==

Viterbi algorithm: Difference between revisions