3625 search results - page 572 / 725 » On choosing |
212
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
198
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
192
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
198
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
212
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...