Sciweavers

1199 search results - page 135 / 240
» Parameterized Proof Complexity
Sort
View
CCS
2008
ACM
13 years 11 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
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 ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 9 months ago
Lower bounds for adaptive linearity tests
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...
Shachar Lovett
ECCV
2000
Springer
14 years 10 months ago
Stochastic Tracking of 3D Human Figures Using 2D Image Motion
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...
Hedvig Sidenbladh, Michael J. Black, David J. Flee...
ICIP
2000
IEEE
14 years 10 months ago
Combined Dynamic Tracking and Recognition of Curves with Application to Road Detection
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...
Frederic Guichard, Jean-Philippe Tarel
ICCS
2009
Springer
14 years 3 months ago
Simulating Individual-Based Models of Epidemics in Hierarchical Networks
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 ...
Rick Quax, David A. Bader, Peter M. A. Sloot