406 search results - page 29 / 82 » Privacy-Preserving Set Union |
161
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
110
click to vote
DM
2006
15 years 4 months ago
2006
For an integer n 3, a rank-n matroid is called an n-spike if it consists of n three-point lines through a common point such that, for all k {1, 2, . . . , n - 1}, the union of e...
118
Voted
NA
2007
15 years 3 months ago
2007
GC-sets are subsets T of Rd of cardinality dim Πn for which, for each τ ∈ T, there are n hyperplanes whose union contains all of T except for τ, thus making interpolation to a...
140
Voted
NDSS
2008
IEEE
15 years 10 months ago
2008
IEEE
Traditionally, techniques for computing on encrypted data have been proposed with privacy preserving applications in mind. Several current cryptosystems support a homomorphic oper...
124
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....