1542 search results - page 97 / 309 » The metamathematics of random graphs |
130
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
136
click to vote
WWW
2010
ACM
15 years 8 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
119
click to vote
SODA
1993
ACM
15 years 3 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
106
click to vote
ISAAC
1997
Springer
15 years 6 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
141
click to vote
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...