Learning Markov networks: maximum bounded tree-width graphs
Year: 2001
Type: conference-paper
Source: Symposium on Discrete Algorithms
Authors: David R. Karger, Nathan Srebro
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2054358802
