4908 search results - page 32 / 982 » On the Complexity of Optimal K-Anonymity |
161
Voted
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
112
Voted
CLUSTER
2007
IEEE
2007
IEEE
Complexity results for throughput and latency optimization of replicated and data-parallel workflows
16 years 13 days ago
VTC
2007
IEEE
16 years 10 days ago
2007
IEEE