Sciweavers

IH
2005
Springer
13 years 10 months ago
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...
Maciej Liskiewicz, Ulrich Wölfel
LATA
2009
Springer
13 years 11 months ago
The Fault Tolerance of NP-Hard Problems
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are...
Christian Glaßer, Aduri Pavan, Stephen D. Tr...