4908 search results - page 317 / 982 » On the Complexity of Optimal K-Anonymity |
188
click to vote
SEBD
2007
15 years 8 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
185
click to vote
ISPA
2005
Springer
16 years 7 days ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
170
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
191
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
The memory subsystem is a major contributor to the performance, power, and area of complex SoCs used in feature rich multimedia products. Hence, memory architecture of the embedded...
174
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...