4908 search results - page 120 / 982 » On the Complexity of Optimal K-Anonymity |
178
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
171
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems...
175
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
188
click to vote
KBSE
1998
IEEE
15 years 10 months ago
1998
IEEE
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
195
click to vote
ICECCS
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—Complex networks consisting of humans and software services, such as Web-based social and collaborative environments, typically require flexible and context-based inter...