Sciweavers

75 search results - page 3 / 15
» Message passing algorithms and improved LP decoding
Sort
View
NIPS
2008
13 years 7 months ago
Clusters and Coarse Partitions in LP Relaxations
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...
David Sontag, Amir Globerson, Tommi Jaakkola
TPDS
1998
108views more  TPDS 1998»
13 years 5 months ago
Critical Path Profiling of Message Passing and Shared-Memory Programs
—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...
Jeffrey K. Hollingsworth
CVPR
2011
IEEE
13 years 2 months ago
Truncated Message Passing
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...
Justin Domke
ICPPW
2000
IEEE
13 years 10 months ago
Scheduling Multiple Multicast for Heterogeneous Network of Workstations with Non-Blocking Message-Passing
This paper proposes efficient algorithms for implementing multicast in heterogeneous workstation/PC clusters. Multicast is an important operation in many scientific and industri...
Shih-Hsien Yeh, Jan-Jan Wu, Pangfeng Liu
JMLR
2012
11 years 8 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
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...
Elad Mezuman, Yair Weiss