75 search results - page 3 / 15 » Message passing algorithms and improved LP decoding |
NIPS
2008
14 years 10 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
TPDS
1998
14 years 9 months ago
1998
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
Training of conditional random fields often takes the form of a double-loop procedure with message-passing inference in the inner loop. This can be very expensive, as the need to...
ICPPW
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper proposes efficient algorithms for implementing multicast in heterogeneous workstation/PC clusters. Multicast is an important operation in many scientific and industri...
113
click to vote
JMLR
2012
12 years 12 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...