406 search results - page 25 / 82 » Privacy-Preserving Set Union |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
MLQ
1998
13 years 7 months ago
1998
Abstract. We investigate the set theoretical strength of some properties of normality, including Urysohn’s Lemma, Tietze-Urysohn Extension Theorem, normality of disjoint unions o...
CCCG
2007
13 years 9 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...