6939 search results - page 721 / 1388 » Algorithm Engineering for Parallel Computation |
197
click to vote
SPAA
2005
ACM
16 years 26 days ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
205
click to vote
SPAA
2005
ACM
16 years 26 days ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
196
click to vote
EGC
2005
Springer
16 years 25 days ago
2005
Springer
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
166
click to vote
PODC
2004
ACM
16 years 22 days ago
2004
ACM
We describe a load-balancing mechanism for assigning elements to servers in a distributed data structure that supports range queries. The mechanism ensures both load-balancing wit...
173
click to vote
PODC
2004
ACM
16 years 22 days ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...