# We increase memory usage by increasing b since ob

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: /Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-45 (of 180) k-best without the penalty Island Summary Scratch Time Cost - Solving the Recurrence To solve it, we can simplify by bounding R(T ) as follows R(T ) < T + b ∗ R(T /b) (9.38) Then, expand R(T ), to get (9.39) R(T ) < T + T + ... + T = O(T logb T ) d=logb (T ) terms We are also deﬁning d logb (T ) which is an important parameter. each forward message (except for the islands themselves) must be computed d = logb (T ) times, which is what leads to the additional computational penalty factor of d. In actuality, there are k terms in the sum, since we stop when we’ve reached a threshold of . Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-45 (of 180) k-best without the penalty Island Summary Scratch Tradeoﬀs can decrease running time and increase space requirements either by increasing b (from 2 on up) or alternatively by increasing (from 2 on up). Prof. Jeﬀ Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-46 (of 180) k-best without...
View Full Document

Ask a homework question - tutors are online