1199 search results - page 135 / 240 » Parameterized Proof Complexity |
CCS
2008
ACM
15 years 2 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
127
click to vote
ECCV
2000
Springer
16 years 2 months ago
2000
Springer
A probabilistic method for tracking 3D articulated human figures in monocular image sequences is presented. Within a Bayesian framework, we define a generative model of image appea...
135
Voted
ICIP
2000
IEEE
16 years 1 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
99
Voted
ICCS
2009
Springer
15 years 7 months ago
2009
Springer
Current mathematical modeling methods for the spreading of infectious diseases are too simplified and do not scale well. We present the Simulator of Epidemic Evolution in Complex ...