Efficiently Solving Dynamic Markov Random Fields using Graph Cuts
Dynamic Programming
CPE 731 Advanced Computer Architecture ILP: Part III – Dynamic Scheduling
John Kubiatowicz Electrical Engineering and Computer Sciences University of California, Berkeley