6365 search results - page 205 / 1273 » Fast Local Computation Algorithms |
177
click to vote
ICIP
1994
IEEE
15 years 10 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
153
click to vote
ICASSP
2008
IEEE
16 years 23 days 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...
153
click to vote
CCA
2005
Springer
15 years 8 months 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...
160
click to vote
CHINAF
2008
15 years 6 months ago
2008
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
183
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...