4908 search results - page 890 / 982 » On the Complexity of Optimal K-Anonymity |
121
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
Evolutionary methods have been used to repair programs automatically, with promising results. However, the fitness function used to achieve these results was based on a few simpl...
131
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
104
click to vote
ICCS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
107
click to vote
DCC
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization ...
CIKM
1999
Springer
15 years 4 months ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...