Gogate, V., P. Domingos. 2010. Formula-Based Probabilistic Inference. In 26th Conference on Uncertainty in Artificial Intelligence.[More][Online version][Bibtex][RIS][MODS]
Hardouin, Cécile, Xavier Guyon. 2010. Exact marginals and normalizing constant for Gibbs distributions. Comptes Rendus de l'Académie des Sciences 348(3-4): 199-201.[More][Online version][Bibtex][RIS][MODS]
Joris M. Mooij. 2010. libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models. Journal of Machine Learning Research 11: 2169-2173.[More][Online version][Bibtex][RIS][MODS]
Otten, L., R. Dechter. 2010. Towards Parallel Search for Optimization in Graphical Models. In Proc. of ISAIM'2010. Fort Lauderdale (FL), USA.[More][Bibtex][RIS][MODS]
Year: 2009
Friel, N. and others. 2009. Bayesian inference in hidden Markov random fields for binary data defined on large lattices. Journal of Computational and Graphical Statistics 18: 243-261.[More][Bibtex][RIS][MODS]
Lecoutre, C. and others. 2009. Reasoning from last conflict(s) in constraint programming. ai 173: 1592,1614.[More][Bibtex][RIS][MODS]
Bessiere, C., Stergiou, K., T. Walsh. 2008. Domain filtering consistencies for non-binary
constraints. Artificial Intelligence 172(6-7): 800-822.[More][Bibtex][RIS][MODS]
Choi, Arthur, Adnan Darwiche. 2008. Approximating the Partition Function by Deleting and then Correcting for Model Edges. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence.[More][Online version][Bibtex][RIS][MODS]
Ghaoui, L. El, A. Gueye. 2008. A Convex Upper Bound on the Log-Partition Function for Binary Graphical Models. In Neural Information Processing Systems.[More][Online version][Bibtex][RIS][MODS]
Krishnamurthy, Dvijotham, Chakrabarti, Soumen, Subhasis Chaudhuri. 2008. New closed-form bounds on the partition function. Machine Learning 72(3): 205-229.[More][Online version][Bibtex][RIS][MODS]
Mooij, Joris M, Hilbert J Kappen. 2008. Bounds on marginal probability distributions. In Advances in Neural Information Processing Systems 21 (NIPS*2008), ed. Koller, D. and others.[More][Online version][Bibtex][RIS][MODS]
Schmidt, M. and others. 2008. Structure Learning in Random Fields for Heart Motion Abnormality Detection. In CVPR'08.[More][Bibtex][RIS][MODS]
Wexler, Ydo, Christopher Meek. 2008. MAS: a multiplicative approximation scheme for probabilistic inference. In NIPS. Vancouver, Canada.[More][Bibtex][RIS][MODS]
Year: 2007
M C. Cooper. 2007. On the minimization of locally-defined submodular
functions. Constraints.[More][Bibtex][RIS][MODS]
Cooper, M C., De Givry, S., T. Schiex. 2007. Optimal soft arc consistency. In Proc. of IJCAI'2007. Hyderabad, India, January.[More][Bibtex][RIS][MODS]
Globerson, A., T. Jaakkola. 2007. Convergent Propagation Algorithms via Oriented Trees. In Uncertainty in Artificial Intelligence.[More][Online version][Bibtex][RIS][MODS]
Heras, Federico, Larrosa, Javier, Albert Oliveras. 2007. MiniMaxSat: A New Weighted Max-SAT
Solver. In Proc. of SAT'2007. LNCS. Lisbon, Portugal, May.[More][Bibtex][RIS][MODS]
Lee, S. -I., Ganapathi, V., D. Koller. 2007. Efficient Structure Learning of Markov Networks using L1-Regularization. In Advances in Neural Information Processing Systems
(NIPS 2006).[More][Online version][Bibtex][RIS][MODS]
M. Molkaraie. 2007. Subtree-based bounds and simulation-based estimations for the partition function..[More][Bibtex][RIS][MODS]
D. Schlesinger. 2007. Exact Solution of Permuted Submodular MinSum
Problems. In Energy Minimization Methods in Computer Vision
and Pattern Recognition. LNCS, August.[More][Bibtex][RIS][MODS]
T. Werner. 2007. A Linear Programming Approach to Max-sum Problem: A Review.. IEEE Trans. on Pattern Recognition and Machine Intelligence 29(7): 1165-1179.[More][Online version][Bibtex][RIS][MODS]
Zytnicki, M., Gaspin, C., T. Schiex. 2007. A new local consistency for weighted CSP dedicated to long domains. In Proceedings of the 2006 ACM Symposium on Applied Computing (SAC). Dijon, France, April.[More][Bibtex][RIS][MODS]
Biblio