Sciweavers

406 search results - page 63 / 82
» Database-friendly random projections
Sort
View
ICRA
2009
IEEE
182views Robotics» more  ICRA 2009»
14 years 2 months ago
Manipulation planning on constraint manifolds
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
INFOCOM
2009
IEEE
14 years 2 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
ICASSP
2008
IEEE
14 years 2 months ago
Wavelet-domain compressive signal reconstruction using a Hidden Markov Tree model
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
ICIP
2008
IEEE
14 years 2 months ago
Image representation by compressed sensing
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
Bing Han, Feng Wu, Dapeng Wu
CCIA
2007
Springer
14 years 1 months ago
Using the Average Landmark Vector Method for Robot Homing
Several methods can be used for a robot to return to a previously visited position. In our approach we use the average landmark vector method to calculate a homing vector which sho...
Alex Goldhoorn, Arnau Ramisa, Ramon López d...