23988 search results - page 4397 / 4798 » Social Network Computing |
194
click to vote
SIGCOMM
2004
ACM
16 years 4 days ago
2004
ACM
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
202
click to vote
SPAA
2004
ACM
16 years 4 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
214
click to vote
ADHOCNOW
2004
Springer
16 years 4 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
171
click to vote
ICS
2004
Tsinghua U.
16 years 3 days ago
2004
Tsinghua U.
In this paper, we study energy conservation techniques for disk array-based network servers. First, we introduce a new conservation technique, called Popular Data Concentration (P...
177
Voted
NOSSDAV
2004
Springer
16 years 2 days ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...