4908 search results - page 19 / 982 » On the Complexity of Optimal K-Anonymity |
STACS
2010
Springer
15 years 9 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
120
click to vote
QOSA
2010
Springer
15 years 3 months ago
2010
Springer
The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effe...
100
click to vote
JC
2002
15 years 1 months ago
2002
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
142
click to vote
COMAD
2009
15 years 3 months ago
2009
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
124
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...