Local computation in junction trees

Thursday, 2 October 2003

Lecture

The lecture will describe the basic local computation algorithm, the main ideas and structure, as well as the basic elements of the algorithm.

The closest  text can be found in Chapter 3 of [PNES], pp. 26-41, which gives an example and an intuitive description, but see also the text in Chapter 6 of [PNES]. pp 83-95

Overheads for screen-viewing and printing. 

 

    Previous lecture

    Next lecture

    Course plan


    Steffen L. Lauritzen < steffen@math.auc.dk>  

    Last modified: 28. oktober 2003