Computing max scores okt logkt dynamic programming okt

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: new maximum assignment. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-26 (of 180) k-best without the penalty Island Summary Scratch Compute Cost max marginal construction O(T N 2 ) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-27 (of 180) k-best without the penalty Island Summary Scratch Compute Cost max marginal construction O(T N 2 ) block construction O(kT N ). Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-27 (of 180) k-best without the penalty Island Summary Scratch Compute Cost max marginal construction O(T N 2 ) block construction O(kT N ). computing max scores: O(kT log(kT )) Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-27 (of 180) k-best without the penalty Island Summary Scratch Compute Cost max marginal construction O(T N 2 ) block construction O(kT N ). computing max scores: O(kT log(kT )) Dynamic programming: O(kT N ). Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-27 (of 18...
View Full Document

This document was uploaded on 04/05/2014.

Ask a homework question - tutors are online