Third best is either in one of original blocks dq1t 1

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: econd best path. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-20 (of 180) k-best without the penalty Island Summary Scratch Finding the 3rd best ∗ the 2nd best is q1:T (2) ∈ DQ1:T (1, t(2) ) where t(2) is the index where there lies a difference between the first and second best path. Third best is either in one of original blocks {DQ1:T (1, t)}t=t(2) that did not contain the second best . . . Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-20 (of 180) k-best without the penalty Island Summary Scratch Finding the 3rd best ∗ the 2nd best is q1:T (2) ∈ DQ1:T (1, t(2) ) where t(2) is the index where there lies a difference between the first and second best path. Third best is either in one of original blocks {DQ1:T (1, t)}t=t(2) that did not contain the second best . . . . . . or otherwise is in the same original block that contained the ∗ ∗ second best q1:T (3) ∈ DQ1:T (1, t(2) ) \ {q1:T (2)}. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-20 (of 180) k-best without the penalty Island Summary Scratch Find...
View Full Document

Ask a homework question - tutors are online