430 search results - page 23 / 86 » An Efficient Parallel Join Algorithm Based On Hypercube-Part... |
210
click to vote
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
111
Voted
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
Modern FPGAs have been designed with advanced integrated circuit techniques that allow high speed and low power performance, joined to reconfiguration capabilities. This makes new...
119
click to vote
ICPP
1987
IEEE
15 years 6 months ago
1987
IEEE
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
178
click to vote
ICDCS
2005
IEEE
15 years 8 months ago
2005
IEEE
Directories have become an important component of the enterprise security and identity management middleware. This paper describes a novel filter based replication model for Light...
147
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
—Many publish/subscribe systems implement a policy for clients to join to their physically closest broker to minimize transmission delays incurred on the clients’ messages. How...