2570 search results - page 76 / 514 » Fast Algorithms For The Computation Of Ranklets |
CAIP
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
109
click to vote
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
ARITH
1993
IEEE
15 years 2 months ago
1993
IEEE
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
ICCS
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and del...
SSPR
2010
Springer
14 years 8 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...