Sciweavers

339 search results - page 21 / 68
» Approximate Inference in Probabilistic Graphical Models with...
Sort
View
74
Voted
IJCAI
2003
14 years 11 months ago
A General Model for Online Probabilistic Plan Recognition
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
Hung Hai Bui
IJON
2010
109views more  IJON 2010»
14 years 4 months ago
Variational inference for Student-t MLP models
This paper presents a novel methodology to infer parameters of probabilistic models whose output noise is a Student-t distribution. The method is an extension of earlier work for ...
Hang T. Nguyen, Ian T. Nabney
JMLR
2010
118views more  JMLR 2010»
14 years 4 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
86
Voted
CVPR
2005
IEEE
15 years 11 months ago
Combining Object and Feature Dynamics in Probabilistic Tracking
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...
Leonid Taycher, John W. Fisher III, Trevor Darrell
JMLR
2006
148views more  JMLR 2006»
14 years 9 months ago
Walk-Sums and Belief Propagation in Gaussian Graphical Models
We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of var...
Dmitry M. Malioutov, Jason K. Johnson, Alan S. Wil...