Sciweavers

406 search results - page 15 / 82
» Privacy-Preserving Set Union
Sort
View
AML
2011
322views Mathematics» more  AML 2011»
13 years 2 months ago
A dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
Arnold W. Miller
JCT
2002
53views more  JCT 2002»
13 years 7 months ago
On Two-Intersection Sets with Respect to Hyperplanes in Projective Spaces
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 ...
Aart Blokhuis, Michel Lavrauw
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
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 ...
Philip Bille, Anna Pagh, Rasmus Pagh
MLQ
2007
73views more  MLQ 2007»
13 years 7 months ago
On completely nonmeasurable unions
Assume that there is no quasi-measurable cardinal not greater than 2ω . We show that for a c.c.c. σ-ideal I with a Borel base of subsets of an uncountable Polish space, if A is a...
Szymon Zeberski
COMPGEOM
2009
ACM
14 years 2 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan