dq1t 1 t2 t 920 where dq1t 1 t2

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: artitioning DQ1:T (1, t(2) ) We partition DQ1:T (1, t(2) ) into T − t + 1 subsets s DQ1:T (1, t(2) , t(2) ), DQ1:T (1, t(2) , t(2) + 1), . . . , DQ1:T (1, t(2) , T ) (9.20) where Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-22 (of 180) k-best without the penalty Island Summary Scratch Finding the 3rd best - partitioning DQ1:T (1, t(2) ) We partition DQ1:T (1, t(2) ) into T − t + 1 subsets s DQ1:T (1, t(2) , t(2) ), DQ1:T (1, t(2) , t(2) + 1), . . . , DQ1:T (1, t(2) , T ) (9.20) where ∗ DQ1:T (1, t(2) , t(2) ) = q1:T ∈ DQ1:T (1, t(2) ) : qt(2) = qt(2) (2) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 (9.21) page 9-22 (of 180) k-best without the penalty Island Summary Scratch Finding the 3rd best - partitioning DQ1:T (1, t(2) ) We partition DQ1:T (1, t(2) ) into T − t + 1 subsets s DQ1:T (1, t(2) , t(2) ), DQ1:T (1, t(2) , t(2) + 1), . . . , DQ1:T (1, t(2) , T ) (9.20) where ∗ DQ1:T (1, t(2) , t(2) ) = q1:T ∈ DQ1:T (1, t(2) ) : qt(2) = qt(2) (2) DQ1:T (1, t(2) , t(2) + 1) = q1:T ∈ DQ1:T Prof. Jeff Bilmes 1,t(2) (9.21) ∗ ∗ : qt(2) = qt(2) (2), qt(2) +1 = qt(2) +1 (2) EE596A/Winter 2013/...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online