406 search results - page 60 / 82 » Privacy-Preserving Set Union |
SSDBM
2008
IEEE
14 years 2 months ago
2008
IEEE
Much real data consists of more than one dimension, such as financial transactions (eg, price × volume) and IP network flows (eg, duration × numBytes), and capture relationship...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
ISSRE
2006
IEEE
14 years 1 months ago
2006
IEEE
Forward computation of dynamic slices is necessary to support interactive debugging and online analysis of long running programs. However, the overhead of existing forward computi...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...