6105 search results - page 783 / 1221 » A Parallel Algorithm for Bound-Smoothing |
184
Voted
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Dynamic replication algorithms aim at allocating, migrating and deleting copies of an object over various Internet hosts, according to the access patterns exhibited online, so as ...
170
Voted
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-Mesh, a network with diameter 4 p N , 3 consisting of N connected meshes of size p N p N...
188
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
258
click to vote
CRYPTO
1999
Springer
15 years 11 months ago
1999
Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
174
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...