Sciweavers

364 search results - page 14 / 73
» Belief Update Using Graphs
Sort
View
NIPS
1996
13 years 11 months ago
Interpreting Images by Propagating Bayesian Beliefs
A central theme of computational vision research has been the realization that reliable estimation of local scene properties requires propagating measurements across the image. Ma...
Yair Weiss
AI
2006
Springer
13 years 9 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
NIPS
2007
13 years 11 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 9 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
13 years 11 months ago
Average Case Analysis of Dynamic Geometric Optimization
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
David Eppstein