Sciweavers

2001 search results - page 125 / 401
» An Update on Generalized Information Theory
Sort
View
CCS
2009
ACM
15 years 10 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
15 years 4 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon
SIGUCCS
2003
ACM
15 years 3 months ago
Computing competencies: ensuring student success
St. Edward’s University has developed a web-based Computer Competency Program ensuring one standard of competency for a diverse student population. Over the past decade faculty ...
Gloria Gonzales-Dholakia
ICRA
1998
IEEE
111views Robotics» more  ICRA 1998»
15 years 2 months ago
Observing Pose and Motion Through Contact
This paper investigates how to "observe" a planar object being pushed by a finger. The pushing is governed by a nonlinear system that relates through contact the object ...
Yan-Bin Jia, Michael Erdmann
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 2 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham