1060 search results - page 85 / 212 » On the Discovery of Random Trees |
101
Voted
AMAI
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
112
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
BMCBI
2007
14 years 10 months ago
2007
Background: There exist many segmentation techniques for genomic sequences, and the segmentations can also be based on many different biological features. We show how to evaluate ...
105
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
80
Voted
SBACPAD
2006
IEEE
2006
IEEE
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
15 years 4 months ago
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...