745 search results - page 52 / 149 » On Generating Random Network Structures: Connected Graphs |
102
click to vote
ICDM
2003
IEEE
15 years 5 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
133
Voted
FPGA
2000
ACM
15 years 4 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
113
Voted
IPMI
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In this paper we propose a novel approach to define task-driven regularization constraints in deformable image registration using learned deformation priors. Our method ...
138
click to vote
MOBIHOC
2002
ACM
16 years 4 days ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
111
click to vote
CCR
2008
15 years 20 days ago
2008
Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. Whi...