On resolving simultaneous congruences using belief propagation
From MaRDI portal
Publication:5380223
DOI10.1162/NECO_A_00702zbMATH Open1414.91311DBLPjournals/neco/YooV15WikidataQ50971768 ScholiaQ50971768MaRDI QIDQ5380223FDOQ5380223
Authors: Yongseok Yoo, Sriram Vishwanath 
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Recommendations
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Belief propagation for min-cost network flow: convergence and correctness
- Correctness of belief propagation in Gaussian graphical models of arbitrary topology
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- Relaxed simultaneous congruences
Cites Work
- Clustering by passing messages between data points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consensus and Cooperation in Networked Multi-Agent Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A coding theory approach to error control in redundant residue number systems. I. Theory and single error correction
- Error Correction in Redundant Residue Number Systems
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Modern Coding Theory
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
- Error Correcting Properties of Redundant Residue Number Systems
- A Binary Variable Model for Affinity Propagation
Cited In (4)
Uses Software
This page was built for publication: On resolving simultaneous congruences using belief propagation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380223)
