4908 search results - page 326 / 982 » On the Complexity of Optimal K-Anonymity |
226
Voted
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
227
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
Building recognition systems for historical documents is a difficult task. Especially, when it comes to medieval scripts. The complexity is mainly affected by the poor quality and...
212
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
168
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
176
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...