6365 search results - page 88 / 1273 » Fast Local Computation Algorithms |
134
click to vote
ICIP
2005
IEEE
15 years 8 months ago
2005
IEEE
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
ICCSA
2003
Springer
15 years 7 months ago
2003
Springer
Numerical simulations of a spherical shock refraction have been successfully conducted by a front tracking method. We demonstrate the e ciency of the front tracking algorithm by co...
118
click to vote
FCT
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
171
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
102
click to vote
DMIN
2007
15 years 3 months ago
2007
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...