198 search results - page 37 / 40 » Weak Probabilistic Anonymity |
SIAMCOMP
2002
13 years 8 months ago
2002
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
EMMCVPR
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The complexity of visual representations is substantially limited by the compositional nature of our visual world which, therefore, renders learning structured object mod...