6393 search results - page 251 / 1279 » Randomized Algorithms on the Mesh |
174
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
164
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
314
click to vote
FIMH
2011
Springer
14 years 10 months ago
2011
Springer
In this paper, we present an effective algorithm to construct a 3D shape atlas for the left ventricle of heart from cardiac Magnetic Resonance Image data. We derive a framework tha...
148
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.