103 search results - page 11 / 21 » Generalized MPU Implicits Using Belief Propagation |
CP
2006
Springer
14 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
TIT
2008
13 years 8 months ago
2008
Abstract--Discrete-input two-dimensional (2-D) Gaussian channels with memory represent an important class of systems, which appears extensively in communications and storage. In sp...
NIPS
2007
13 years 11 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
CVPR
2006
IEEE
14 years 12 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
CVPR
2005
IEEE
14 years 12 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...