4908 search results - page 914 / 982 » On the Complexity of Optimal K-Anonymity |
114
click to vote
KDD
2007
ACM
16 years 8 days ago
2007
ACM
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
178
click to vote
POPL
2008
ACM
16 years 5 days ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
189
click to vote
POPL
2006
ACM
16 years 5 days ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
110
click to vote
RECOMB
2008
Springer
16 years 5 days ago
2008
Springer
Abstract. One phylogeny-based approach to horizontal gene transfer (HGT) detection entails comparing the topology of a gene tree to that of the species tree, and using their differ...
RECOMB
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...