Mixing sum-product and max-product type updates to tighten tree-reweighted upper bounds for the log-partiton function

author: Tamir Hazan, School of Computer Science and Engineering, The Hebrew University of Jerusalem
published: Jan. 13, 2011,   recorded: December 2010,   views: 280
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

See Also:

Download slides icon Download slides: nipsworkshops2010_hazan_msp_01.pdf (2.7┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: