4908 search results - page 58 / 982 » On the Complexity of Optimal K-Anonymity |
200
click to vote
ESWS
2011
Springer
14 years 9 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
199
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
172
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
145
click to vote
MOR
2002
15 years 5 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
181
click to vote
ICIP
2007
IEEE
16 years 14 days ago
2007
IEEE
A methodology for complexity scalable video encoding and complexity control within the framework of the H.264/AVC video encoder is presented. To yield good rate-distortion perform...