Sciweavers

1618 search results - page 172 / 324
» Testing random number generators
Sort
View
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
12 years 24 days ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
NIPS
2004
13 years 11 months ago
Common-Frame Model for Object Recognition
A generative probabilistic model for objects in images is presented. An object consists of a constellation of features. Feature appearance and pose are modeled probabilistically. ...
Pierre Moreels, Pietro Perona
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 3 months ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
14 years 3 months ago
Estimating the detector coverage in a negative selection algorithm
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
Zhou Ji, Dipankar Dasgupta
IJCNLP
2005
Springer
14 years 3 months ago
Topic Tracking Based on Linguistic Features
This paper explores two linguistically motivated restrictions on the set of words used for topic tracking on newspaper articles: named entities and headline words. We assume that n...
Fumiyo Fukumoto, Yusuke Yamaji