At the next level we store only islands at any given

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: n or equal to , we can stop dividing. We make k as small as possible in order to divide the length T segment into as few as possible chunks, thereby making the final linear chunks as large as possible, while still meeting the constraint that the chunk is ≤ . We can solve for k exactly, as k = logb (T / ) . Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-40 (of 180) k-best without the penalty Island Summary Scratch More analysis at the top level, we need b − 1 islands (since we don’t store the right most one). Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-41 (of 180) k-best without the penalty Island Summary Scratch More analysis at the top level, we need b − 1 islands (since we don’t store the right most one). At the next level, we store only islands at any given time for one of the length T /b segments, and within that segment we store, again at most b − 1 islands. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-41 (of...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online