745 search results - page 24 / 149 » On Generating Random Network Structures: Connected Graphs |
101
click to vote
SRDS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
123
click to vote
JMLR
2012
13 years 2 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
132
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
117
Voted
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
106
click to vote
MICCAI
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...