630 search results - page 3 / 126 » Optimized union of non-disjoint distributed data sets |
88
Voted
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
ML
2007
ACM
14 years 9 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
KDD
2005
ACM
15 years 3 months ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...