13214 search results - page 2526 / 2643 » Pseudorandomness for network algorithms |
185
click to vote
ICS
2005
Tsinghua U.
15 years 10 months ago
2005
Tsinghua U.
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
135
click to vote
PADS
2004
ACM
15 years 10 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
153
click to vote
SIGCOMM
2004
ACM
15 years 10 months 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...
151
click to vote
SPAA
2004
ACM
15 years 10 months 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...
137
click to vote
CCS
2004
ACM
15 years 10 months ago
2004
ACM
Payload attribution is an important problem often encountered in network forensics. Given an excerpt of a payload, finding its source and destination is useful for many security ...