745 search results - page 71 / 149 » On Generating Random Network Structures: Connected Graphs |
105
Voted
IJAR
2010
14 years 11 months ago
2010
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
82
Voted
MOBICOM
2004
ACM
15 years 6 months ago
2004
ACM
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
111
Voted
UAI
2004
15 years 2 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
93
Voted
CORR
2010
Springer
15 years 21 days ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
79
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...