4908 search results - page 856 / 982 » On the Complexity of Optimal K-Anonymity |
147
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
177
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
191
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
150
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
XML delivers key advantages in interoperability due to its flexibility, expressiveness, and platform-neutrality. As XML has become a performance-critical aspect of the next genera...
299
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...