2434 search results - page 13 / 487 » Algorithmic Randomness of Closed Sets |
146
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Recovery of three dimensional (3D) shape and motion of non-static scenes from a monocular video sequence is important for applications like robot navigation and human computer inte...
113
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
142
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
144
Voted
STACS
2012
Springer
13 years 11 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
145
click to vote
EUROCRYPT
2012
Springer
13 years 5 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...