Je bilmes ee596awinter 2013dgms lecture 9 feb 6th

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: e 9 - Feb 6th, 2013 page 9-26 (of 180) k-best without the penalty Island Summary Scratch General case the same pattern as above, iterative procedure to construct the next best. The basic pattern is: 1) look at the current partition of states sequences and find the block that contains the maximum; Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-26 (of 180) k-best without the penalty Island Summary Scratch General case the same pattern as above, iterative procedure to construct the next best. The basic pattern is: 1) look at the current partition of states sequences and find the block that contains the maximum; 2) partition that subset based on the set of possible differences; Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-26 (of 180) k-best without the penalty Island Summary Scratch General case the same pattern as above, iterative procedure to construct the next best. The basic pattern is: 1) look at the current partition of states sequences and find the block that contains the maximum; 2) partition that subset based on the set of possible differences; 3) make sure that we have the computed...
View Full Document

Ask a homework question - tutors are online