736 search results - page 73 / 148 » Algorithms for Ordinal Arithmetic |
TSP
2008
15 years 2 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
AICCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
122
Voted
TSP
2010
14 years 9 months ago
2010
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
111
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
103
click to vote
ICPP
1993
IEEE
15 years 6 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...