4908 search results - page 807 / 982 » On the Complexity of Optimal K-Anonymity |
147
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Secure communications in wireless ad hoc networks require setting up end-to-end secret keys for communicating node pairs. Due to physical limitations and scalability requirements, ...
184
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
196
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
174
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...
167
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Attributes define, classify, or annotate the datum to which they are assigned. However, traditional attribute architectures and cryptosystems are ill-equipped to provide security ...