4908 search results - page 368 / 982 » On the Complexity of Optimal K-Anonymity |
187
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenanc...
201
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
193
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
190
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
184
click to vote
SIGPRO
2010
15 years 5 months ago
2010
This paper proposes a novel compression scheme with a tunable complexity-ratedistortion trade-off. As images increase in size and resolution, more efficient compression schemes w...