1434 search results - page 258 / 287 » Distributed Computing with Imperfect Randomness |
135
click to vote
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
119
Voted
EUROCRYPT
2005
Springer
15 years 7 months ago
2005
Springer
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
128
click to vote
ACMSE
2004
ACM
15 years 7 months ago
2004
ACM
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
129
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
116
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...