4908 search results - page 291 / 982 » On the Complexity of Optimal K-Anonymity |
224
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
207
click to vote
ARTCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
189
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
209
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
221
Voted
CC
2008
Springer
15 years 8 months ago
2008
Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...