2570 search results - page 38 / 514 » Fast Algorithms For The Computation Of Ranklets |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
180
click to vote
ARITH
2011
IEEE
13 years 10 months ago
2011
IEEE
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
PARA
1994
Springer
15 years 1 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
102
click to vote
PARELEC
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an organic computing approach for very fast image processing, which we call Marching Pixels (MPs). Using an embedded massively-parallel array of processor elements (PEs...
APCCAS
2006
IEEE
14 years 12 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...