Sciweavers

70 search results - page 4 / 14
» Adaptive Importance Sampling Technique for Markov Chains Usi...
Sort
View
UAI
2003
13 years 8 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
JMLR
2010
145views more  JMLR 2010»
13 years 2 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
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 6 days ago
A simulation-based method for aggregating Markov chains
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
Kun Deng, Prashant G. Mehta, Sean P. Meyn
IPSN
2004
Springer
14 years 25 days ago
A probabilistic approach to inference with limited information in sensor networks
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas
ECCV
2002
Springer
14 years 9 months ago
Hyperdynamics Importance Sampling
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
Cristian Sminchisescu, Bill Triggs