406 search results - page 57 / 82 » Privacy-Preserving Set Union |
AMW
2009
14 years 11 months ago
2009
In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target sc...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
DM
2010
14 years 10 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
MVA
2007
14 years 9 months ago
2007
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
116
click to vote
COMGEO
2011
ACM
14 years 5 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...