2735 search results - page 123 / 547 » Comparing notions of randomness |
ASIACRYPT
2006
Springer
14 years 1 months ago
2006
Springer
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
ICML
2003
IEEE
14 years 11 months ago
2003
IEEE
The paper extends the notion of linear programming boosting to handle uneven datasets. Extensive experiments with text classification problem compare the performance of a number o...