Sciweavers

406 search results - page 22 / 82
» Privacy-Preserving Set Union
Sort
View
JACM
1998
88views more  JACM 1998»
13 years 7 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
TFS
2008
77views more  TFS 2008»
13 years 7 months ago
Nonstationary Fuzzy Sets
In this paper, the notion termed a "nonstationary fuzzy set" is introduced, and the concept of a perturbation function that is used for generating nonstationary fuzzy set...
Jonathan M. Garibaldi, Marcin Jaroszewski, Salang ...
AGP
1999
IEEE
13 years 11 months ago
Comparing expressiveness of set constructor symbols
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
Agostino Dovier, Carla Piazza, Alberto Policriti
PODS
2005
ACM
118views Database» more  PODS 2005»
14 years 7 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
CORR
2010
Springer
44views Education» more  CORR 2010»
13 years 4 months ago
Maximum union-free subfamilies
An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in th...
Jacob Fox, Choongbum Lee, Benny Sudakov