Often this is good owing to low tree width of 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: ithout the penalty Island Summary Scratch Time/Space Tradeoffs in Dynamic Model Exact Inference Dynamic graphical models have a special shape. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-31 (of 180) k-best without the penalty Island Summary Scratch Time/Space Tradeoffs in Dynamic Model Exact Inference Dynamic graphical models have a special shape. Normally, DGMs have time complexity O(T N 2 ) and O(T N ) memory complexity. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-31 (of 180) k-best without the penalty Island Summary Scratch Time/Space Tradeoffs in Dynamic Model Exact Inference Dynamic graphical models have a special shape. Normally, DGMs have time complexity O(T N 2 ) and O(T N ) memory complexity. Often this is good, owing to low tree-width of the model. Prof. Jeff Bilmes EE596A/Winter 2013/DGMs – Lecture 9 - Feb 6th, 2013 page 9-31 (of 180) k-best without the penalty Island Summary Scratch Time/Space Tradeoffs in Dynamic Model Exact Inf...
View Full Document

Ask a homework question - tutors are online