Sciweavers

1176 search results - page 214 / 236
» Sparse reward processes
Sort
View
IJRR
2002
159views more  IJRR 2002»
13 years 10 months ago
Mapping Partially Observable Features from Multiple Uncertain Vantage Points
This paper presents a technique for mapping partially observable features from multiple uncertain vantage points. The problem of concurrent mapping and localization (CML) is state...
John J. Leonard, Richard J. Rikoski, Paul M. Newma...
IJRR
2002
98views more  IJRR 2002»
13 years 10 months ago
Robust Mapping and Localization in Indoor Environments Using Sonar Data
In this paper we describe a new technique for the creation of featurebased stochastic maps using standard Polaroid sonar sensors. The fundamental contributions of our proposal are...
Juan D. Tardós, José Neira, Paul M. ...
TROB
2008
106views more  TROB 2008»
13 years 10 months ago
Discovering Higher Level Structure in Visual SLAM
We describe a novel method for discovering and incorporating higher level map structure in a real-time visual SLAM system. Previous approaches use sparse maps, populated by isolate...
Andrew P. Gee, Denis Chekhlov, Andrew Calway, Walt...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 9 months ago
The LASSO risk for gaussian matrices
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
Mohsen Bayati, Andrea Montanari
FOCM
2010
140views more  FOCM 2010»
13 years 9 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen