Sciweavers

3 search results - page 1 / 1
» Sliding window greedy RLS for sparse filters
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Sliding window greedy RLS for sparse filters
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplifie...
Alexandru Onose, Bogdan Dumitrescu, Ioan Tabus
ICASSP
2011
IEEE
12 years 8 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor
INFFUS
2008
175views more  INFFUS 2008»
13 years 4 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi