We describe a method for computing closed sets with data-dependent constraints. Especially, we show how the method can be adapted to find frequent closed sets in a given data set...
In [2] a construction of a class of two-intersection sets with respect to hyperplanes in PG(r - 1, qt ), rt even, is given, with the same parameters as the union of (qt/2 - 1)/(q ...
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...