4908 search results - page 923 / 982 » On the Complexity of Optimal K-Anonymity |
WABI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
106
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
101
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
108
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...