406 search results - page 12 / 82 » Privacy-Preserving Set Union |
111
click to vote
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
120
click to vote
COCOA
2010
Springer
15 years 1 months ago
2010
Springer
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
240
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
115
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
102
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...