13214 search results - page 338 / 2643 » Pseudorandomness for network algorithms |
190
click to vote
ESA
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
192
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
153
click to vote
CN
2006
15 years 6 months ago
2006
A fair allocation of utility (application-layer performance) is essential in providing QoS (Quality of Service) guarantee. However, there have been few researches in the literatur...
223
click to vote
SPAA
1996
ACM
15 years 11 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
181
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...