List of Figures
I.1 The graph associated with the inference problem of Exercise I.1.
A.1 A tree of diagnoses for stubborn cars.
2.4 Hypergraph, primal graph and dual graph.
2.5 Possibilities of knowledgebase representation.
2.6 Bayesian network of a medical example.
2.7 A digital circuit of a binary adder.
2.8 The result table of a full adder circuit.
2.9 Connecting two 1-bit-adders produces a 2-bit-adder.
2.10 Input and output of a discrete Fourier transform.
2.11 Function board of a discrete Fourier transform.
3.1 Finalization of the graphical fusion process.
3.2 Extending a labeled tree to a join tree.
3.3 The bucket-tree of Example 3.5.
3.4 The join tree obtained from the bucket-tree of Figure 3.3
3.5 The join tree for Example 1.2.
3.6 Different elimination sequences produce different join trees.
3.7 A primal graph and its induced graph.
3.8 A covering join tree of an inference problem.
3.9 The fusion algorithm as message-passing scheme.
3.10 A covering join tree of Instance 2.1.
3.11 A covering join tree of Instance 2.1.
3.12 A graph with two possible triangulations.
3.13 The triangulated primal graph of Instance 2.1.
3.14 Join graph and derived join tree.
3.15 A complete run of the collect algorithm.
3.16 Join tree of a discrete Fourier transform.
4.1 Changing the root of a join tree.
4.2 Mailboxes in the Shenoy-Shafer architecture.
4.3 Join tree to illustrate the Shenoy-Shafer architecture. ...
