4908 search results - page 21 / 982 » On the Complexity of Optimal K-Anonymity |
103
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
101
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
117
click to vote
STACS
2009
Springer
15 years 6 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...