Sciweavers

20441 search results - page 465 / 4089
» Locally Computable Structures
Sort
View
APAL
1998
121views more  APAL 1998»
15 years 6 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
ICRA
2009
IEEE
149views Robotics» more  ICRA 2009»
16 years 1 months ago
LSH-RANSAC: An incremental scheme for scalable localization
Abstract— This paper addresses the problem of featurebased robot localization in large-size environments. With recent progress in SLAM techniques, it has become crucial for a rob...
Kenichi Saeki, Kanji Tanaka, Takeshi Ueda
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
16 years 1 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
JFR
2008
103views more  JFR 2008»
15 years 6 months ago
Monte Carlo localization in outdoor terrains using multilevel surface maps
We propose a novel combination of techniques for robustly estimating the position of a mobile robot in outdoor environments using range data. Our approach applies a particle filte...
Rainer Kümmerle, Rudolph Triebel, Patrick Pfa...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
15 years 5 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno