4908 search results - page 38 / 982 » On the Complexity of Optimal K-Anonymity |
102
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper presents a novel perspective to the use of multiobjective optimization and in particular evolutionary multi-objective optimization (EMO) as a measure of comple...
103
click to vote
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
— Moments are generic (and usually intuitive) descriptors that can be computed from several kinds of objects defined either from closed contours or from a set of points. In this...
162
click to vote
TEC
2012
13 years 4 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
128
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...