Sciweavers

1231 search results - page 110 / 247
» A Framework for Belief Update
Sort
View
TSP
2008
151views more  TSP 2008»
15 years 16 days ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
118
Voted
ICTAI
2010
IEEE
14 years 10 months ago
A Closer Look at MOMDPs
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...
Mauricio Araya-López, Vincent Thomas, Olivi...
ICMLA
2009
14 years 10 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
CDC
2010
IEEE
148views Control Systems» more  CDC 2010»
14 years 7 months ago
Distributed parameter estimation in networks
In this paper, we present a model of distributed parameter estimation in networks, where agents have access to partially informative measurements over time. Each agent faces a loca...
Kamiar Rahnama Rad, Alireza Tahbaz-Salehi
120
Voted
JMLR
2010
145views more  JMLR 2010»
14 years 7 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever