Sciweavers

4908 search results - page 28 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 5 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 2 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
ICASSP
2007
IEEE
15 years 8 months ago
Oversampled Inverse Complex Lapped Transform Optimization
When an oversampled FIR filter bank structure is used for signal analysis, a main problem is to guarantee its invertibility and to be able to determine an inverse synthesis filt...
Jérôme Gauthier, Laurent Duval, Jean-...
ICC
2007
IEEE
15 years 8 months ago
Optimal Pilot Symbol Distribution for Efficient and Low-Complexity Doppler-Shift and Doppler-Rate Estimation in Bursty Transmiss
— Due to relative motion between the transmitter and the receiver, the carrier of the received signal in digital burstmode transmission can be affected by Doppler distortion. Thi...
Luca Giugno, Francesca Zanier, Marco Luise
99
Voted
JSAC
2007
86views more  JSAC 2007»
15 years 1 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
Petros Elia, Frédérique E. Oggier, P...