4908 search results - page 30 / 982 » On the Complexity of Optimal K-Anonymity |
122
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
LICS
2007
IEEE
15 years 8 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
133
click to vote
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
122
click to vote
AAAI
2010
15 years 3 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
112
click to vote
DBISP2P
2004
Springer
15 years 7 months ago
2004
Springer
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...