10 topics£º
1. Introduction to search algorithms on various graphs structures
(Spaces, representations, operators, constraints, metrics, heuristics)
2. Relaxation-Labeling with line drawing example
3. Markov chains for scientific computing
4. Gibbs sampler and Metropolis-Hastings
5. Data Augmentation and cluster sampling
6. Swendsen-Wang cuts
7. Reversible jumps
8. Data-driven Markov chain Monte Carlo
9. parsing techniques in programming languages
10. Top-down and bottom-up image parsing.
(11 optional) Exact sampling |