Hence further divide each of the length t b

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: ill linear in T but factor b reduction. The compute requirements increase, since perform an additional (b − 1) forward passes each of which costs T /b. Hence, the compute requirements now are O(N 2 ((b − 1)T /b + T )), again still linear in T but with an increase. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-34 (of 180) k-best without the penalty Island Summary Scratch Island algorithm: idea, recursion Each length T /b segment at some point looks like a normal forward/backwards pass. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-35 (of 180) k-best without the penalty Island Summary Scratch Island algorithm: idea, recursion Each length T /b segment at some point looks like a normal forward/backwards pass. Hence, each such forward/backwards pass can have the same process repeated. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-35 (of 180) k-best without the penalty Island Summary Scratch Island algor...
View Full Document

Ask a homework question - tutors are online