20 search results - page 2 / 4 » Approximate Privacy: PARs for Set Problems |
HPCC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail ...
CVPR
2012
IEEE
11 years 8 months ago
2012
IEEE
Modeling representations of image patches that are quasi-invariant to spatial deformations is an important problem in computer vision. In this paper, we propose a novel concept, t...
WADS
2007
Springer
13 years 12 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...
PODS
2011
ACM
12 years 8 months ago
2011
ACM
Scientific workflow systems increasingly store provenance information about the module executions used to produce a data item, as well as the parameter settings and intermediate...
FOCS
2007
IEEE
14 years 4 days ago
2007
IEEE
We study the role that privacy-preserving algorithms, which prevent the leakage of specific information about participants, can play in the design of mechanisms for strategic age...