Communication Complexity Lower Bounds in Distributed Message-Passing.
Rotem OshmanPublished in: SIROCCO (2014)
Keyphrases
- message passing
- distributed systems
- lower bound
- interconnection networks
- belief propagation
- worst case
- upper bound
- probabilistic inference
- singly connected
- factor graphs
- distributed shared memory
- sum product algorithm
- shared memory
- inference in graphical models
- markov random field
- sum product
- approximate inference
- computational complexity
- complexity analysis
- high quality
- loopy belief propagation
- branch and bound
- junction tree
- maximum likelihood
- stereo matching
- lp relaxation
- super resolution
- vc dimension
- ldpc codes
- np hard
- max product
- expectation maximization
- optimal solution