4908 search results - page 128 / 982 » On the Complexity of Optimal K-Anonymity |
194
click to vote
CEC
2008
IEEE
16 years 27 days ago
2008
IEEE
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
163
click to vote
CAIP
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
174
click to vote
CASES
2009
ACM
15 years 11 months ago
2009
ACM
Nanowire crossbar circuits are an emerging architectural paradigm that promises a higher integration density and an improved fault-tolerance due to its reconfigurability. In this...
180
click to vote
EUROCRYPT
1997
Springer
15 years 10 months ago
1997
Springer
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
163
click to vote
WSC
2008
15 years 8 months ago
2008
Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operati...