Sciweavers

495 search results - page 3 / 99
» Adaptive Triangular System Solving
Sort
View
PC
2002
158views Management» more  PC 2002»
13 years 6 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
ISCAS
1993
IEEE
78views Hardware» more  ISCAS 1993»
13 years 11 months ago
A Multi-layer 2-D Adaptive Filtering Architecture Based on McClellan Transformation
A fully pipelined systolic array structure for multidimensional adaptive filtering is proposed. It utilizes the wellknown McClellan Transformation (MT) to reduce the total number ...
K. J. Ray Liu, An-Yeu Wu
WIA
2000
Springer
13 years 10 months ago
Solving Complex Problems Efficiently with Adaptive Automata
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
João José Neto
ICASSP
2011
IEEE
12 years 10 months ago
Subspace constrained LU decomposition of FMLLR for rapid adaptation
This paper describes subspace constrained feature space maximum likelihood linear regression (FMLLR) for rapid adaptation. The test speaker’s FMLLR rotation matrix is decomposed...
Lei Jia, Dong Yu, Bo Xu
MP
2008
115views more  MP 2008»
13 years 7 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan