Sciweavers

970 search results - page 30 / 194
» Adaptive Analysis of On-line Algorithms
Sort
View
ICASSP
2009
IEEE
15 years 4 months ago
On robustness of coupled adaptive filters
We provide a time domain analysis of the robustness and stability performance for coupled adaptive algorithms of gradient type. The considered coupling may occur inherently as wel...
Robert Dallinger, Marjus Rupp
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 1 months ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li
ICDAR
2011
IEEE
13 years 9 months ago
OCR-Driven Writer Identification and Adaptation in an HMM Handwriting Recognition System
—We present an OCR-driven writer identification algorithm in this paper. Our algorithm learns writer-specific characteristics more precisely from explicit character alignment usi...
Huaigu Cao, Rohit Prasad, Prem Natarajan
ICALP
2000
Springer
15 years 1 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
ICASSP
2011
IEEE
14 years 1 months ago
On gradient type adaptive filters with non-symmetric matrix step-sizes
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...
Markus Rupp