Sciweavers

2434 search results - page 1 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 5 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
FOCS
2008
IEEE
13 years 7 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 1 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
CIE
2009
Springer
14 years 17 days ago
Members of Random Closed Sets
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
David Diamondstone, Bjørn Kjos-Hanssen
ICRA
2002
IEEE
183views Robotics» more  ICRA 2002»
13 years 11 months ago
Mobile Robot Localization Based on Random Closed Set Model Maps
In this paper we present a novel approach to mobile robot navigation in natural unstructured environments. Natural scenes can be considered as random fields where a large number ...
Stefan Rolfes, Maria-João Rendas