745 search results - page 7 / 149 » On Generating Random Network Structures: Connected Graphs |
127
Voted
AI
2006
Springer
15 years 14 days ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
132
click to vote
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
124
Voted
CN
2010
14 years 9 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
119
Voted
BMCBI
2006
15 years 14 days ago
2006
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
116
click to vote
PKDD
2007
Springer
15 years 6 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...