2570 search results - page 49 / 514 » Fast Algorithms For The Computation Of Ranklets |
ICCSA
2003
Springer
15 years 3 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...
FCT
1995
Springer
15 years 1 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...
TVCG
2010
14 years 8 months ago
2010
—We are interested in 3-dimensional images given as arrays of voxels with intensity values. Extending these values to a continuous function, we study the robustness of homology c...
126
click to vote
CPM
1998
Springer
15 years 2 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...
DMIN
2007
14 years 11 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 ...