63 search results - page 9 / 13 » The Complexity of Iterated Belief Revision |
85
Voted
AAAI
2006
14 years 11 months ago
2006
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...
82
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we...
96
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
111
Voted
CVPR
2004
IEEE
16 years 9 days ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
98
Voted
NOMS
2002
IEEE
15 years 3 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...