935 search results - page 70 / 187 » DataExchange: High Performance Communications in Distributed... |
128
Voted
RSA
1998
15 years 4 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
151
click to vote
FAST
2007
15 years 6 months ago
2007
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are...
134
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
133
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
140
click to vote
ICCCN
2008
IEEE
15 years 11 months ago
2008
IEEE
—Parallel firewalls offer a scalable low latency design for inspecting packets at high speeds. Typically consisting of an array of m firewalls, these systems filter arriving p...