32 page 9 42 of 180 k best without the penalty island

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: 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. This repeats, and since there are k levels (the depth is k ), there is an additional memory cost of k (b − 1). 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 Analysis Memory Therefore, for a segment of length T , this algorithm never keeps simultaneously in memory more than about M expanded frames, where M = T /bk + k ∗ (b − 1) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 (9.31) page 9-42 (of 180) k-best without the penalty Island Summary Scratch Analysis Memory Therefore, for a segment of length T , this algorithm never keeps simultaneously in memory more than about M expanded fra...
View Full Document

Ask a homework question - tutors are online