2570 search results - page 115 / 514 » Fast Algorithms For The Computation Of Ranklets |
89
Voted
ICCV
2009
IEEE
14 years 8 months ago
2009
IEEE
Measuring image similarity is a central topic in computer vision. In this paper, we learn similarity from Flickr groups and use it to organize photos. Two images are similar if th...
ERSHOV
2003
Springer
15 years 3 months ago
2003
Springer
We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framew...
ICIP
1994
IEEE
15 years 2 months ago
1994
IEEE
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a new low complexity and fast converging frequencydomain adaptive algorithm for sparse system identification. This is achieved by exploiting the MMax and SP tap-select...
CCA
2005
Springer
15 years 4 days ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...