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.
Learning Markov Networks: Maximum Bounded Tree-Width Graphs [link]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