4908 search results - page 18 / 982 » On the Complexity of Optimal K-Anonymity |
125
click to vote
DAGSTUHL
2006
15 years 3 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
107
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
123
click to vote
ARITH
2003
IEEE
15 years 7 months ago
2003
IEEE
Using the self duality of an optimal normal basis (ONB) of type II, we present a bit parallel systolic multiplier over GF(2m ) which has a low hardware complexity and a low latenc...
127
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
111
click to vote
TIT
2010
14 years 8 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...