T so log base changes for dierent we get memory

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: ing the algorithm either to run out of memory or start swapping. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-47 (of 180) k-best without the penalty Island Summary Scratch Setting the parameters Alternatively, can take b = segment lengths). Prof. Jeff Bilmes √ T (so log base changes for different EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-48 (of 180) k-best without the penalty Island Summary Scratch Setting the parameters Alternatively, can take b = segment lengths). √ T (so log base changes for different we get memory complexity of √ √ O(b × logb (T )) = O( T × 2) = O( T ) memory Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-48 (of 180) k-best without the penalty Island Summary Scratch Setting the parameters Alternatively, can take b = segment lengths). √ T (so log base changes for different we get memory complexity of √ √ O(b × logb (T )) = O( T × 2) = O( T ) memory compute becomes O(T logb (T )) = O(2 × T ) = O(T ) compute...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online