361 search results - page 6 / 73 » Maximum subset intersection |
118
click to vote
NETWORKING
2004
15 years 3 months ago
2004
Subset Difference Revocation (SDR) [8] has been proposed to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message ove...
DAM
2006
15 years 1 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
COMGEO
2008
ACM
15 years 2 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
114
click to vote
CCCG
1997
15 years 3 months ago
1997
Motivated by the problem of labeling maps, we investigate the problem of computing a large non-intersecting subset in a set of n rectangles in the plane. Our results are as follow...