This is where we get the ologb t memory in general the

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: s 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 ). Also that k = logb (T / ). 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 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 ). Also that k = logb (T / ). Ex: if = 3, and b = 3, then we keep simultaneously in memory no more than about 3 + 2 log3 (T /3) frames, which has only logarithmic growth in T. This is where we get the O(logb (T )) memory. 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 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 ). Also that k = logb (T / ). Ex: if = 3, and b = 3, then we keep simultaneously in memory no more than about 3...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online