46 search results - page 2 / 10 » Inside-Outside Probability Computation for Belief Propagatio... |
JMLR
2006
13 years 4 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
— Decisions on sources with memory transmitted over independent channels can be taken by employing trellis calculations. In this paper, it is shown that for a certain class of fu...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
ICCV
2005
IEEE
14 years 6 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
CPAIOR
2008
Springer
13 years 6 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...