2996 search results - page 90 / 600 » Numberings and Randomness |
116
Voted
EUROCRYPT
2012
Springer
13 years 3 months ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
225
Voted
POPL
2003
ACM
16 years 1 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
96
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
95
Voted
COMPSAC
2008
IEEE
15 years 7 months ago
2008
IEEE
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...