2570 search results - page 135 / 514 » Fast Algorithms For The Computation Of Ranklets |
132
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
128
Voted
DAGSTUHL
2008
15 years 4 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
124
click to vote
VLSM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is simil...
152
Voted
CODES
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a software implementation of a very fast parallel Reed-Solomon decoder on the second generation of MorphoSys reconfigurable computation platform, which is targ...
126
click to vote
VISUALIZATION
2003
IEEE
15 years 8 months ago
2003
IEEE
Segmentation of structures from measured volume data, such as anatomy in medical imaging, is a challenging data-dependent task. In this paper, we present a segmentation method tha...