564 search results - page 56 / 113 » Approximation algorithms for restricted Bayesian network str... |
115
click to vote
SDM
2008
SIAM
15 years 2 months ago
2008
SIAM
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
98
Voted
BMCBI
2008
15 years 22 days ago
2008
Background: The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this proble...
AAAI
2000
15 years 2 months ago
2000
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
138
click to vote
MST
2010
14 years 7 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
194
click to vote
VLDB
2006
ACM
16 years 25 days ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...