# or at time t t2 with there being no dierence from

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ween the second best path q1:T (2) and third best ∗ (2) may be either: path q1:T at time t(2) , or at time t(2) + 1 with there being no diﬀerence at time t(2) , or at time t(2) + 2 with there being no diﬀerence either at time t(2) , or at time t(2) + 1, ... or at time t > t(2) with there being no diﬀerence from time t(2) through time t − 1 Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-21 (of 180) k-best without the penalty Island Summary Scratch Finding the 3rd best - partitioning DQ1:T (1, t(2) ) The ﬁrst time (meaning the frame closest to t = t(2) ) at which there ∗ is a diﬀerence between the second best path q1:T (2) and third best ∗ (2) may be either: path q1:T at time t(2) , or at time t(2) + 1 with there being no diﬀerence at time t(2) , or at time t(2) + 2 with there being no diﬀerence either at time t(2) , or at time t(2) + 1, ... or at time t > t(2) with there being no diﬀerence from time t(2) through time t − 1 etc. up to time T . Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-21 (of 180) k-best without the penalty Island Summary Scratch Finding the 3rd best - p...
View Full Document

Ask a homework question - tutors are online