Sciweavers

224 search results - page 13 / 45
» GMRES Methods for Least Squares Problems
Sort
View
SIAMJO
2011
13 years 3 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
IJPRAI
1998
100views more  IJPRAI 1998»
13 years 8 months ago
Obtaining The Correspondence between Bayesian and Neural Networks
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
Athena Stassopoulou, Maria Petrou
ICASSP
2011
IEEE
13 years 9 days ago
Relative proportionate NLMS: Improving convergence for acoustic channel identification
It is known that the proportionate normalized least mean square (PNLMS) algorithm outperforms traditional normalized least mean square(NLMS) algorithm, in terms of fast initial co...
Tao Yu, John H. L. Hansen
DAM
2008
111views more  DAM 2008»
13 years 8 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
ECCV
2010
Springer
14 years 28 days ago
A Robust and Scalable Approach to Face Identification
The problem of face identification has received significant attention over the years. For a given probe face, the goal of face identification is to match this unknown face against ...