4908 search results - page 181 / 982 » On the Complexity of Optimal K-Anonymity |
193
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
163
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper revisits the problem of source-channel coding for error-resilient video streaming, using redundant encoding. We propose a new method to jointly optimize the macroblock ...
193
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
159
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— The Particle Swarm Optimization (PSO) algorithm is a robust stochastic evolutionary computation technique based on the movement and intelligence of swarms. This paper p...
161
click to vote
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...