2434 search results - page 28 / 487 » Algorithmic Randomness of Closed Sets |
114
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— This paper considers the problem of multi-robot patrol around a closed area with the existence of an adversary attempting to penetrate into the area. In case the adversary know...
106
click to vote
ALT
2008
Springer
15 years 11 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
112
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Particle filters encode a time-evolving probability density by maintaining a random sample from it. Level sets represent closed curves as zero crossings of functions of two variab...
106
click to vote
PDP
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper investigate a mutual exclusion algorithm on distributed systems. We introduce a new algorithm based on the Naimi-Trehel algorithm, taking advantage of the distributed a...