4007 search results - page 285 / 802 » Computation with imprecise probabilities |
149
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
144
click to vote
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
139
click to vote
DCC
2006
IEEE
16 years 4 months ago
2006
IEEE
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
119
click to vote
DCC
2001
IEEE
16 years 4 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
112
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
The discovery of events in time series can have important implications, such as identifying microlensing events in astronomical surveys, or changes in a patient’s electrocardiog...