ML
2007
ACM
13 years 10 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
DAM
2000
13 years 10 months ago
2000
For a
EJC
2007
13 years 11 months ago
2007
A minimal k-cycle is a family of sets A0, . . . , Ak−1 for which Ai ∩ Aj = ∅ if and only if i = j or i and j are consecutive modulo k. Let fr(n, k) be the maximum size of a ...
JCDCG
2000
Springer
14 years 2 months ago
2000
Springer
We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...