236 search results - page 10 / 48 » From Weak to Strong Watermarking |
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
FTCS
1998
14 years 11 months ago
1998
The trend in implementing today's embedded applications is toward the use of commercial-off-the-shelf open architecture. Reducing costs and facilitating systems integration a...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...