prof je bilmes ee596awinter 2013dgms lecture 9 feb

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: sest to t = t(2) ) at which there ∗ is a difference between the second best path q1:T (2) and third best ∗ (2) may be either: path q1:T at or or or Prof. Jeff Bilmes time t(2) , at time t(2) + 1 with there being no difference at time t(2) , at time t(2) + 2 with there being no difference either at time t(2) , at time t(2) + 1, 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 first time (meaning the frame closest to t = t(2) ) at which there ∗ is a difference 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 difference at time t(2) , or at time t(2) + 2 with there being no difference either at time t(2) , or at time t(2) + 1, ... Prof. Jeff 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 first time (meaning the frame closest to t = t(2) ) at which there ∗ is a difference bet...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online