A general framework for comparing (approximate) inference algorithms

A general framework for comparing (approximate) inference algorithms

Cached

Download Links

[www.cs.ubc.ca]

Other Repositories/Bibliography

DBLP

by Frank Hutter , Sohrab Shah

BibTeX

@MISC{Hutter_ageneral,
    author = {Frank Hutter and Sohrab Shah},
    title = {A general framework for comparing (approximate) inference algorithms },
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

5662	Probabilistic reasoning in intelligent systems: networks of plausible inference - Pearl - 1988
907	Fast approximate energy minimization via graph cuts - Boykov, Veksler, et al.
709	A taxonomy and evaluation of dense two-frame stereo correspondence algorithms - Scharstein, Szeliski - 2002
424	What energy functions can be minimized via graph cuts - Kolmogorov, Zabih
394	KB: Dynamic Bayesian networks: representation, inference and learning - Murphy
229	Bucket elimination: a unifying framework for reasoning - Dechter - 1999
214	Understanding belief propagation and its generalizations - Yedidia, Freeman, et al. - 2001
203	Nonuniversal critical dynamics in Monte Carlo simulations - Swendsen, Wang - 1987
123	Markov Random Fields with efficient approximations - BOYKOV, VEKSLER, et al. - 1998
92	Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters - Tappen, Freeman - 2003
86	Discriminative fields for modeling spatial dependencies in natural images - Kumar, Hebert - 2004
86	The potts model - Wu - 1982
69	Collective Monte Carlo updating for spin systems - Wolff
33	A comparison of algorithms for inference and learning in probabilistic graphical models - Frey, Jojic - 2005
23	Comparing the mean field method and belief propagation for approximate inference in MRFs - Weiss - 2001
5	Stochastic local search for solving the most probable explanation problem in Bayesian networks - Hutter - 2004