1538 search results - page 49 / 308 » Relative Randomness and Cardinality |
ISPEC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
We introduce a novel approach to expert finding based on multi-step relevance propagation from documents to related candidates. Relevance propagation is modeled with an absorbing ...
COMBINATORICA
2008
14 years 8 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
145
click to vote
CC
2010
Springer
14 years 4 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...