BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Developments in Exact Inference in Graphical Models - Stephen Past
 eris (UCL)
DTSTART:20160607T093000Z
DTEND:20160607T103000Z
UID:TALK66504@talks.cam.ac.uk
CONTACT:Zoubin Ghahramani
DESCRIPTION:My talk is split into two parts:\n\n      Part 1 - I develop a
 n algorithm for dynamic updating and marginalisation in tree-structured Ma
 rkov Random Fields. This algorithm is always at least as fast as any other
  algorithm and in some cases is exponentially faster than any other algori
 thm. The initialisation time required by the algorithm is the optimal\, li
 near time.\n\n      Part 2 - The junction tree algorithm can be slow when 
 we have large supernodes of high degree and when we have such supernodes t
 he difference in time complexity between different architectures becomes v
 ery obvious. Previously\, the fastest junction tree algorithms had a very 
 large memory requirement. I develop a junction tree architecture which has
 \, essentially\, state of the art speed (faster than HUGIN propagation) wh
 ile essentially maintaining the low space requirement of the slower Shafer
 -Shennoy propagation.\n\n 
LOCATION:Engineering Department\, CBL Room BE-438
END:VEVENT
END:VCALENDAR