120 search results - page 12 / 24 » Low Complexity Algorithms for Linear Recurrences |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The paper discusses computationally efficient NLMS and RLS algorithms for a broad class of nonlinear filters using periodic input sequences. The class comprises all nonlinear ...
DSD
2010
IEEE
13 years 7 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
TSP
2008
13 years 7 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...
PODC
2003
ACM
14 years 18 days ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...