4908 search results - page 869 / 982 » On the Complexity of Optimal K-Anonymity |
177
click to vote
ASPLOS
2006
ACM
15 years 8 months ago
2006
ACM
Different uses of memory protection schemes have different needs in terms of granularity. For example, heap security can benefit from chunk separation (by using protected "pa...
175
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
182
click to vote
NETWORKING
2008
15 years 7 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...
176
click to vote
PDPTA
2007
15 years 7 months ago
2007
Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack...
164
click to vote
DLOG
2004
15 years 7 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...