2924 search results - page 329 / 585 » Lower Bounds in Distributed Computing |
161
click to vote
CONCUR
2003
Springer
15 years 9 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
124
Voted
ICMCS
2009
IEEE
15 years 2 months ago
2009
IEEE
This paper presents a new approach to 3D shape comparison and retrieval based on the computation of Gaussian transforms of the surface model on a set of points regularly distribut...
132
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
150
click to vote
CVPR
2001
IEEE
16 years 6 months ago
2001
IEEE
In this paper we describe a statistical method for the integration of an unlimited number of cues within a deformable model framework. We treat each cue as a random variable, each...
157
click to vote
SOFSEM
2000
Springer
15 years 8 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...