Sciweavers

1170 search results - page 15 / 234
» How Fast Is Too Fast
Sort
View
111
Voted
ICML
2010
IEEE
15 years 1 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CG
2007
Springer
15 years 24 days ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
95
Voted
ICASSP
2009
IEEE
15 years 7 months ago
Fast noise PSD estimation with low complexity
Although noise PSD estimation is a crucial part of noise reduction algorithms, most noise PSD estimators have problems in tracking non-stationary noise sources. Recently, a noise ...
Richard C. Hendriks, Richard Heusdens, Jesper Jens...
VISUALIZATION
1995
IEEE
15 years 4 months ago
Fast Multiresolution Surface Meshing
We present a new method for adaptive surface meshing and triangulationwhichcontrolsthelocallevel–of–detailofthesurface approximation by local spectral estimates. These estimat...
Oliver G. Staadt, Markus H. Gross, Roger Gatti
IJCAI
2007
15 years 2 months ago
Fast Image Alignment Using Anytime Algorithms
Image alignment refers to finding the best transformation from a fixed reference image to a new image of a scene. This process is often guided by similarity measures between ima...
Rupert Brooks, Tal Arbel, Doina Precup