Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Andrew E. Gelfand"'
Publikováno v:
IEEE Transactions on Information Theory. 64:1471-1480
We study the maximum weight matching (MWM) problem for general graphs through the max-product belief propagation (BP) and related Linear Programming (LP). The BP approach provides distributed heuristics for finding the maximum a posteriori (MAP) assi
Publikováno v:
Advanced Structured Prediction ISBN: 9780262322959
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cfd09e204e5d85533cc6c3155e950d1
https://doi.org/10.7551/mitpress/9969.003.0010
https://doi.org/10.7551/mitpress/9969.003.0010
Publikováno v:
ISIT
Belief Propagation (BP) is a popular, distributed heuristic for performing MAP computations in Graphical Models. BP can be interpreted, from a variational perspective, as minimizing the Bethe Free Energy (BFE). BP can also be used to solve a special
Publikováno v:
ICCV
We present a new method to combine possibly inconsistent locally (piecewise) trained conditional models p(y α ∣x α ) into pseudo-samples from a global model. Our method does not require training of a CRF, but instead generates samples by iteratin
Publikováno v:
SPIE Proceedings.
One of the greatest challenges in modern combat is maintaining a high level of timely Situational Awareness (SA). In many situations, computational complexity and accuracy considerations make the development and deployment of real-time, high-level in