4908 search results - page 256 / 982 » On the Complexity of Optimal K-Anonymity |
170
click to vote
LATINCRYPT
2010
15 years 5 months ago
2010
Abstract. Broadcast (BC) is considered as the most fundamental primitive for fault-tolerant distributed computing and cryptographic protocols. An important and practical variant of...
168
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
170
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Color features are among the most important features used in image database retrieval, especially in cases where no additional semantic information is available. Due to its compac...
187
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
The complexity and physical distribution of modern active-safety automotive applications requires the use of distributed architectures. These architectures consist of multiple ele...
174
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...