# We make k as small as possible in order to divide the

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: enalty Island Summary Scratch Analysis Detail We are given , the “linear section threshold” we keep a linear segment of length in memory, so we divide T into bk chunks, and once the chunks are smaller than or equal to , we can stop dividing. Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-40 (of 180) k-best without the penalty Island Summary Scratch Analysis Detail We are given , the “linear section threshold” we keep a linear segment of length in memory, so we divide T into bk chunks, and once the chunks are smaller than 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 ﬁnal linear chunks as large as possible, while still meeting the constraint that the chunk is ≤ . Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-40 (of 180) k-best without the penalty Island Summary Scratch Analysis Detail We are given , the “linear section threshold” we keep a linear segment of length in memory, so we divide T into bk chunks, and once the chunks are smaller tha...
View Full Document

## This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online