2079 search results - page 109 / 416 » Universality of random graphs |
215
click to vote
CVPR
2010
IEEE
16 years 25 days ago
2010
IEEE
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...
130
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
136
click to vote
TIT
1998
15 years 4 months ago
1998
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
158
click to vote
HT
2010
ACM
15 years 6 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
137
click to vote
JSYML
2008
15 years 4 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...