4949 search results - page 10 / 990 » Consistency and Set Intersection |
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
DM
2002
13 years 10 months ago
2002
We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1 k-1 ) is at least k provided that k 6 n=2
ICDE
2012
IEEE
12 years 25 days ago
2012
IEEE
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
ACSC
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
EJC
2000
13 years 10 months ago
2000
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.