Sciweavers

6251 search results - page 371 / 1251
» Randomness, Computability, and Density
Sort
View
DCC
2010
IEEE
15 years 6 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
IPPS
1999
IEEE
15 years 11 months ago
A Formal Definition of the Phenomenon of Collective Intelligence and its IQ Measure
This paper formalizes the concept of Collective Intelligence (C-I). Application of the Random PROLOG Processor (RPP) has allowed us to model the phenomenon of C-I in social structu...
Tadeusz Szuba
RANDOM
1998
Springer
15 years 11 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger
IJNSEC
2008
103views more  IJNSEC 2008»
15 years 6 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao
COLING
2010
15 years 1 months ago
TimeML Events Recognition and Classification: Learning CRF Models with Semantic Roles
This paper analyzes the contribution of semantic roles to TimeML event recognition and classification. For that purpose, an approach using conditional random fields with a variety...
Hector Llorens, Estela Saquete, Borja Navarro-Colo...