ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Optimality of belief propagation for random assignment problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: J. Salez INRIA and Ecole Normale Supérieure de Paris
D. Shah Massachussets Institute of Technology
Published in:
· Proceeding
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2009
table of contents
Optimality of belief propagation for random assignment problem 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder