Sciweavers

187 search results - page 4 / 38
» Computational methods for Generalized Sturmians basis
Sort
View
SIAMSC
2008
187views more  SIAMSC 2008»
14 years 9 months ago
The Generalized Singular Value Decomposition and the Method of Particular Solutions
A powerful method for solving planar eigenvalue problems is the Method of Particular Solutions (MPS), which is also well known under the name "point matching method". In ...
Timo Betcke
TASLP
2008
120views more  TASLP 2008»
14 years 9 months ago
Rapid Speaker Adaptation Using Clustered Maximum-Likelihood Linear Basis With Sparse Training Data
Abstract-- Speaker space based adaptation methods for automatic speech recognition have been shown to provide significant performance improvements for tasks where only a few second...
Yun Tang, Richard Rose
TASLP
2011
14 years 4 months ago
Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation Space
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
Zbynek Koldovský, Petr Tichavský
VRST
2000
ACM
15 years 1 months ago
Animated deformations with radial basis functions
We present a novel approach to creating deformations of polygonal models using Radial Basis Functions (RBFs) to produce localized real-time deformations. Radial Basis Functions as...
Jun-yong Noh, Douglas Fidaleo, Ulrich Neumann
ISSAC
2005
Springer
125views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Generalized normal forms and polynomial system solving
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Bernard Mourrain