Sciweavers

6365 search results - page 10 / 1273
» Fast Local Computation Algorithms
Sort
View
CISS
2008
IEEE
15 years 4 months ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
JGTOOLS
2006
80views more  JGTOOLS 2006»
14 years 9 months ago
A Fast Method for Local Penetration Depth Computation
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
Stephane Redon, Ming C. Lin
VISUALIZATION
1999
IEEE
15 years 2 months ago
Spiraling Edge: Fast Surface Reconstruction from Partially Organized Sample Points
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
Patricia Crossno, Edward Angel
FSR
2007
Springer
108views Robotics» more  FSR 2007»
15 years 4 months ago
Robust Real-Time Local Laser Scanner Registration with Uncertainty Estimation
We present a fast, robust method for registering successive laser rangefinder scans. Correspondences between the current scan and previous scans are determined. Gaussian uncertai...
Justin Carlson, Charles E. Thorpe, David L. Duke
MOBIHOC
2006
ACM
15 years 9 months ago
Robust distributed node localization with error management
Location knowledge of nodes in a network is essential for many tasks such as routing, cooperative sensing, or service delivery in ad hoc, mobile, or sensor networks. This paper in...
Juan Liu, Ying Zhang, Feng Zhao