613 search results - page 57 / 123 » Matching Power |
CCS
2009
ACM
14 years 9 months ago
2009
ACM
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...
ICPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
MIDDLEWARE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Content-based Publish/Subscribe (CPS) is a powerful paradigm providing loosely-coupled, event-driven messaging services. Although the general CPS model is well-known, man...
SMI
2006
IEEE
14 years 2 months ago
2006
IEEE
We develop a new surface matching framework to handle surface comparisons based on a novel mathematical analysis of curves on surfaces, and propose a unique signature for any clos...