16 search results - page 4 / 4 » Decomposing SAT Problems into Connected Components |
166
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...