406 search results - page 20 / 82 » Privacy-Preserving Set Union |
EJC
2002
14 years 9 months ago
2002
A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every elem...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
JGT
2008
14 years 10 months ago
2008
We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisf...
CCCG
2003
14 years 11 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...