4377 search results - page 109 / 876 » Mass problems and randomness |
166
click to vote
ICPR
2002
IEEE
16 years 6 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
167
click to vote
VLSID
2005
IEEE
15 years 11 months ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
179
click to vote
ICIP
2008
IEEE
16 years 7 months ago
2008
IEEE
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
145
click to vote
STACS
2009
Springer
16 years 9 days ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
145
Voted
AIIA
2009
Springer
16 years 4 days ago
2009
Springer
This paper studies the following question: given an instance of the propositional satisfiability problem, a randomized satisfiability solver, and a cluster of n computers, what i...