Sciweavers

506 search results - page 27 / 102
» Network Engineering for Complex Belief Networks
Sort
View
PRICAI
2004
Springer
14 years 26 days ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
NIPS
2008
13 years 9 months ago
Evaluating probabilities under high-dimensional latent variable models
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
Iain Murray, Ruslan Salakhutdinov
NIPS
2000
13 years 8 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck
UAI
2000
13 years 8 months ago
Adaptive Importance Sampling for Estimation in Structured Domains
Sampling is an important tool for estimating large, complex sums and integrals over highdimensional spaces. For instance, importance sampling has been used as an alternative to ex...
Luis E. Ortiz, Leslie Pack Kaelbling
BMCBI
2010
175views more  BMCBI 2010»
13 years 7 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...