4908 search results - page 349 / 982 » On the Complexity of Optimal K-Anonymity |
195
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We develop a general approach for designing scheduling policies for real-time traffic over wireless channels. We extend prior work, which characterizes a real-time flow by its traf...
146
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we present a no-reference blur metric for images and video. The blur metric is based on the analysis of the spread of the edges in an image. Its perceptual signific...
188
Voted
HM
2007
Springer
16 years 29 days ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
164
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
139
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
The well-known Griewangk function, used for evaluation of evolutionary algorithms, becomes easier as the number of dimensions grows. This paper suggests three alternative implemen...