5153 search results - page 121 / 1031 » Introduction to Randomized Algorithms |
121
Voted
JMIV
2002
15 years 2 months ago
2002
Three-dimensional depth information of a surface can be encoded in a two-dimensional image called single-image random-dotstereograms or, more widely known, autostereograms. It is ...
134
click to vote
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
129
click to vote
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
130
click to vote
EUROCOLT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
132
Voted
ICIP
2010
IEEE
15 years 14 days ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...