Sciweavers

995 search results - page 30 / 199
» complexity 2011
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Incremental-cooperative strategies in combination of adaptive filters
A new topology for combination of adaptive filters is proposed. Based on incremental strategies, the standard convexly combined parallel-independent filters are rearranged into ...
Wilder B. Lopes, Cassio G. Lopes
134
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
ICASSP
2011
IEEE
14 years 6 months ago
The Centered Discrete Fourier Transform and a parallel implementation of the FFT
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the...
Dale H. Mugler
SIAMNUM
2011
139views more  SIAMNUM 2011»
14 years 9 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
ICASSP
2011
IEEE
14 years 6 months ago
Time-lagged Directed Information
Directed Information (DI) has recently been introduced to quantify the causality between two signals. However, one major remaining issue with DI is the computational complexity wh...
Ying Liu, Selin Aviyente