4908 search results - page 863 / 982 » On the Complexity of Optimal K-Anonymity |
193
click to vote
WISE
2005
Springer
16 years 1 hour ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
167
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
177
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
205
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
163
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...