Learning Markov Networks: Maximum Bounded Tree-Width Graphs. Karger, D. & Srebro, N. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 392–401, 2001. Society for Industrial and Applied Mathematics. Paper bibtex @inproceedings{karger2001learning,
title={Learning Markov Networks: Maximum Bounded Tree-Width Graphs},
author={Karger, David and Srebro, Nathan},
booktitle={Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
pages={392--401},
year={2001},
organization={Society for Industrial and Applied Mathematics},
url_Paper={https://dl.acm.org/doi/10.5555/365411.365486}
}
Downloads: 0
{"_id":"AB72uWHcCt5XsaxQx","bibbaseid":"karger-srebro-learningmarkovnetworksmaximumboundedtreewidthgraphs-2001","authorIDs":["3AvMzPYKCwJ47GDa9","EHMXLrfGuoBWJma4Y","LggRPMQ9gYftaaitv","Z6Duw9GRvyRSY5HoX","aCideRtgMzdYSNQLG","nmmAcRWAsCMNA5DWa","pMxxicnBGZfB4wmW7","qE8E2QsF2nJsQCvyo","tDcgcQ2rQBSi5fSMC","wvLJWtBn62aGEAczQ","x5GySF8B9B99de7CM"],"author_short":["Karger, D.","Srebro, N."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Learning Markov Networks: Maximum Bounded Tree-Width Graphs","author":[{"propositions":[],"lastnames":["Karger"],"firstnames":["David"],"suffixes":[]},{"propositions":[],"lastnames":["Srebro"],"firstnames":["Nathan"],"suffixes":[]}],"booktitle":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","pages":"392–401","year":"2001","organization":"Society for Industrial and Applied Mathematics","url_paper":"https://dl.acm.org/doi/10.5555/365411.365486","bibtex":"@inproceedings{karger2001learning,\n title={Learning Markov Networks: Maximum Bounded Tree-Width Graphs},\n author={Karger, David and Srebro, Nathan},\n booktitle={Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},\n pages={392--401},\n year={2001},\n organization={Society for Industrial and Applied Mathematics},\n url_Paper={https://dl.acm.org/doi/10.5555/365411.365486}\n}\n\n","author_short":["Karger, D.","Srebro, N."],"key":"karger2001learning","id":"karger2001learning","bibbaseid":"karger-srebro-learningmarkovnetworksmaximumboundedtreewidthgraphs-2001","role":"author","urls":{" paper":"https://dl.acm.org/doi/10.5555/365411.365486"},"metadata":{"authorlinks":{"srebro, n":"https://nati.ttic.edu/research.html"}}},"bibtype":"inproceedings","biburl":"natisb.github.io/Pub.bib","creationDate":"2020-06-22T00:52:05.847Z","downloads":0,"keywords":[],"search_terms":["learning","markov","networks","maximum","bounded","tree","width","graphs","karger","srebro"],"title":"Learning Markov Networks: Maximum Bounded Tree-Width Graphs","year":2001,"dataSources":["MKpBoHoD8jbmsQitE","gXDHDS9LFkGrW59EE","RQcQjmmjQdZFcGmkL","d2cjLLaXdKBg4GZbu"]}