4908 search results - page 24 / 982 » On the Complexity of Optimal K-Anonymity |
119
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
138
click to vote
JSAC
2008
15 years 1 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
219
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
100
Voted
EOR
2008
15 years 2 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
127
click to vote
ICPR
2002
IEEE
15 years 6 months ago
2002
IEEE
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of m...