6800 search results - page 384 / 1360 » On optimizing collective communication |
213
click to vote
FOCS
2004
IEEE
15 years 11 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
203
click to vote
CN
2002
15 years 7 months ago
2002
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
210
click to vote
SIGMETRICS
2011
ACM
14 years 10 months ago
2011
ACM
Recent work on BitTorrent swarms has demonstrated that a bandwidth bottleneck at the seed can lead to the underutilization of the aggregate swarm capacity. Bandwidth underutilizat...
304
click to vote
TOG
2012
13 years 10 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
292
click to vote
ICDE
2005
IEEE
16 years 9 months ago
2005
IEEE
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...