Sciweavers

6365 search results - page 75 / 1273
» Fast Local Computation Algorithms
Sort
View
144
Voted
PARELEC
2006
IEEE
15 years 8 months ago
Marching Pixels - Using Organic Computing Principles in Embedded Parallel Hardware
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
Marcus Komann, Dietmar Fey
APCCAS
2006
IEEE
261views Hardware» more  APCCAS 2006»
15 years 4 months ago
A Grouped Fast Fourier Transform Algorithm Design For Selective Transformed Outputs
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
Chih-Peng Fan, Guo-An Su
ICDIM
2008
IEEE
15 years 8 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
ICRA
2007
IEEE
114views Robotics» more  ICRA 2007»
15 years 8 months ago
Spherical Laser Point Sampling with Application to 3D Scene Genetic Registration
— Scene registration of 3D laser rangefinder scans is increasingly being required in applications, such as mobile robotics, that demand a timely response. For speeding up point ...
Jorge L. Martínez, Antonio Reina, Anthony M...
SIGGRAPH
1994
ACM
15 years 6 months ago
A fast shadow algorithm for area light sources using backprojection
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
George Drettakis, Eugene Fiume