2519 search results - page 184 / 504 » Martingales and Locality in Distributed Computing |
ICDCS
2002
IEEE
14 years 3 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
ICAC
2005
IEEE
14 years 3 months ago
2005
IEEE
Modern computing environments, such as enterprise data centers, Grids, and PlanetLab, introduce distributed services to address scalability, locality, and reliability. Web Service...
PODC
2006
ACM
14 years 4 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
WEBDB
2005
Springer
14 years 3 months ago
2005
Springer
This document presents the JXP algorithm for dynamically and collaboratively computing PageRank-style authority scores of Web pages distributed in a P2P network. In the architectu...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...