876 search results - page 46 / 176 » Limits on the Usefulness of Random Oracles |
CHES
2003
Springer
14 years 4 months ago
2003
Springer
A true random number generator (TRNG) usually consists of two components: an “unpredictable” source with high entropy, and a randomness extractor — a function which, when app...
ICB
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we propose a random network ensemble for face recognition problem, particularly for images with a large appearance variation and with a limited number of training se...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
ICOIN
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...