Prof 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: 9.26) and also, when the first difference between the 3rd and 2nd best is at time t, we have that for t > t(2) , ∗ ∗ ∗ DQ1:T (1, t(2) , t) = q1:T : q1 = q1 (1), q2 = q2 (1), qt(2) −1 = qt(2) −1 (1), . . . , ∗ qt(2) = qt(2) (1), ∗ ∗ ∗ ∗ qt(2) = qt(2) (2), qt(2) +1 = qt(2) +1 (2), . . . , qt−1 = qt−1 (2), qt = qt (2) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page (9.27) 9-23 (of 180) k-best without the penalty Island Summary Scratch Partitioning Thus, the blocks {DQ1:T (1, t)}t=t(2) and DQ1:T (1, t(2) , t) constitute the partitioning of DQ1:T \ {q1:T (1), q1:T (2)}. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 t≥t(2) page 9-24 (of 180) k-best without the penalty Island Summary Scratch Partitioning Thus, the blocks {DQ1:T (1, t)}t=t(2) and DQ1:T (1, t(2) , t) constitute the partitioning of DQ1:T \ {q1:T (1), q1:T (2)}. t≥t(2) Use same strategy as before: score each block (based on max path within), find the (a) max, and then compute it withi...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online