1830 search results - page 280 / 366 » Workshop on Graph Computation Models |
141
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
151
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
152
click to vote
PPOPP
2012
ACM
14 years 14 days ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
166
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
139
click to vote
HICSS
2006
IEEE
15 years 11 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...