Sciweavers

1054 search results - page 70 / 211
» Fast Approximated SIFT
Sort
View
CORR
2010
Springer
253views Education» more  CORR 2010»
14 years 10 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
DM
2006
91views more  DM 2006»
14 years 10 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
SIAMSC
2008
117views more  SIAMSC 2008»
14 years 9 months ago
Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
María López-Fernández, Christ...
IPPS
2010
IEEE
14 years 7 months ago
Optimizing and tuning the fast multipole method for state-of-the-art multicore architectures
This work presents the first extensive study of singlenode performance optimization, tuning, and analysis of the fast multipole method (FMM) on modern multicore systems. We consid...
Aparna Chandramowlishwaran, Samuel Williams, Leoni...
ICIP
2003
IEEE
15 years 11 months ago
Fast GEM wavelet-based image deconvolution algorithm
The paper proposes a new wavelet-based Bayesian approach to image deconvolution, under the space-invariant blur and additive white Gaussian noise assumptions. Image deconvolution ...
José M. Bioucas-Dias