4908 search results - page 615 / 982 » On the Complexity of Optimal K-Anonymity |
205
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
177
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
220
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
We demonstrate ProSem, a scalable wide-area publish/subscribe system that supports complex, stateful subscriptions as well as simple ones. One unique feature of ProSem is its cost...
167
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
180
click to vote
ICSE
2004
IEEE-ACM
16 years 7 months ago
2004
IEEE-ACM
1 Feature Oriented Programming (FOP) is an emerging paradigm for application synthesis, analysis, and optimization. A target application is specified declaratively as a set of feat...