4908 search results - page 879 / 982 » On the Complexity of Optimal K-Anonymity |
VLSID
2006
IEEE
16 years 8 days ago
2006
IEEE
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
RECOMB
2005
Springer
16 years 6 days ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
104
click to vote
RECOMB
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
102
click to vote
RECOMB
2004
Springer
16 years 6 days ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
STOC
2004
ACM
16 years 6 days ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...