12 search results - page 1 / 3 » Deterministic Decentralized Search in Random Graphs |
WAW
2007
Springer
14 years 5 months ago
2007
Springer
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
AP2PC
2004
Springer
14 years 4 months ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
JSAC
2008
13 years 11 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...