2 search results - page 1 / 1 » Improving the Efficiency of Gibbs Sampling for Probabilistic... |
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
CVPR
2010
IEEE
14 years 27 days ago
2010
IEEE
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...