549 search results - page 102 / 110 » On the Complexity of Restricted k-anonymity Problem |
129
click to vote
BMCBI
2004
14 years 9 months ago
2004
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
ASIACRYPT
2007
Springer
15 years 4 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
WABI
2001
Springer
15 years 2 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...