Sciweavers

131 search results - page 1 / 27
» A General Method for Reducing the Complexity of Relational I...
Sort
View
AAAI
2008
13 years 6 months ago
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
Hoifung Poon, Pedro Domingos, Marc Sumner
PR
2011
12 years 7 months ago
Generalized darting Monte Carlo
One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge ...
Cristian Sminchisescu, Max Welling
IPPS
2010
IEEE
13 years 2 months ago
On the parallelisation of MCMC-based image processing
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
Jonathan M. R. Byrd, Stephen A. Jarvis, Abhir H. B...
VLSISP
2002
123views more  VLSISP 2002»
13 years 4 months ago
Monte Carlo Bayesian Signal Processing for Wireless Communications
Abstract. Many statistical signal processing problems found in wireless communications involves making inference about the transmitted information data based on the received signal...
Xiaodong Wang, Rong Chen, Jun S. Liu
ECCV
2006
Springer
14 years 6 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr