33 segments so our memory storage requirements is om

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: mes, where M = T /bk + k ∗ (b − 1) (9.31) where k is the smallest integer value such that T /bk ≤ Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 (9.32) 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 frames, where M = T /bk + k ∗ (b − 1) (9.31) where k is the smallest integer value such that T /bk ≤ (9.32) and where is the linear segment threshold, i.e., the segment length threshold below which linear forward-backward inference is performed. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-42 (of 180) k-best without the penalty Island Summary Scratch Analysis Memory Detail Since k is such that T /bk ≤ , we we keep in memory no more than about M ≤ + k ∗ (b − 1) (9.33) segments, so our memory storage requirements is O(M ). Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-43 (of 180) k-best without the penalty Island Summary Scratch Analysi...
View Full Document

Ask a homework question - tutors are online