Learning Markov networks: maximum bounded tree-width graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: David Karger MIT Laboratory for Computer Science, Cambridge, MA
Nathan Srebro MIT Laboratory for Computer Science, Cambridge, MA
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pages 392-401
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2001
table of contents ISBN:0-89871-490-7
Learning Markov networks: maximum bounded tree-width graphs 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 26
· Downloads (cumulative): 666
· Citation Count: 13


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 © 2013 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