1722 search results - page 219 / 345 » Variables in Concept Graphs |
140
click to vote
UAI
2000
15 years 5 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
156
click to vote
ACTA
2007
15 years 4 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
105
click to vote
SIAMDM
2008
15 years 4 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
113
click to vote
TIT
2008
15 years 4 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
124
click to vote
MST
2007
15 years 3 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...