4908 search results - page 385 / 982 » On the Complexity of Optimal K-Anonymity |
214
click to vote
LCTRTS
2010
Springer
16 years 1 months ago
2010
Springer
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
164
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
169
click to vote
GLOBECOM
2006
IEEE
16 years 27 days ago
2006
IEEE
Abstract— In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and...
167
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The development of coherent and dynamic behaviors for mobile robots is an exceedingly complex endeavor ruled by task objectives, environmental dynamics and the interactions within...
208
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...