1021 search results - page 48 / 205 » Fast Approximate PCPs |
149
click to vote
ISBI
2004
IEEE
16 years 2 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
116
click to vote
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
118
click to vote
PPAM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
122
click to vote
VMV
2003
15 years 3 months ago
2003
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
104
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...