4908 search results - page 627 / 982 » On the Complexity of Optimal K-Anonymity |
155
click to vote
ESWS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
149
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
155
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
165
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
157
click to vote
ICA
2007
Springer
16 years 1 months ago
2007
Springer
FastICA is arguably one of the most widespread methods for independent component analysis. We focus on its deflation-based implementation, where the independent components are ext...