20638 search results - page 208 / 4128 » Computer Networks |
217
Voted
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
231
Voted
CONCURRENCY
1998
15 years 6 months ago
1998
The JPVM library is a software system for explicit message-passing based distributed memory MIMD parallel programming in Java. The library supports an interface similar to the C a...
187
Voted
SIROCCO
2008
15 years 8 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
151
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
194
Voted
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...