Sciweavers

56 search results - page 4 / 12
» Approximation of Data by Decomposable Belief Models
Sort
View
ICRA
2010
IEEE
101views Robotics» more  ICRA 2010»
13 years 6 months ago
Searching for objects: Combining multiple cues to object locations using a maximum entropy model
— In this paper, we consider the problem of how background knowledge about usual object arrangements can be utilized by a mobile robot to more efficiently find an object in an ...
Dominik Joho, Wolfram Burgard
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
RECOMB
2007
Springer
14 years 8 months ago
Free Energy Estimates of All-Atom Protein Structures Using Generalized Belief Propagation
We present a technique for approximating the free energy of protein structures using Generalized Belief Propagation (GBP). The accuracy and utility of these estimates are then demo...
Hetunandan Kamisetty, Eric P. Xing, Christopher Ja...
ICPR
2004
IEEE
14 years 8 months ago
Detection of Artificial Structures in Natural-Scene Images Using Dynamic Trees
We seek a framework that addresses localization, detection and recognition of man-made objects in natural-scene images in a unified manner. We propose to model artificial structur...
Michael C. Nechyba, Sinisa Todorovic
NIPS
2007
13 years 9 months ago
Discovering Weakly-Interacting Factors in a Complex Stochastic Process
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
Charlie Frogner, Avi Pfeffer