Sciweavers

5 search results - page 1 / 1
» Solving Time of Least Square Systems in Sigma-Pi Unit Networ...
Sort
View
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 4 months ago
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the soluti...
Pierre Courrieu
PRL
2011
12 years 11 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
ICTAI
2008
IEEE
13 years 11 months ago
The Performance of Approximating Ordinary Differential Equations by Neural Nets
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
Josef Fojdl, Rüdiger W. Brause
HOTOS
1993
IEEE
13 years 9 months ago
Object Groups May Be Better Than Pages
I argue against trying to solve the problem of clustering objects into disk pages. Instead, I propose that objects be fetched in groups that may be specific to an application or ...
Mark Day
JMLR
2006
389views more  JMLR 2006»
13 years 4 months ago
A Very Fast Learning Method for Neural Networks Based on Sensitivity Analysis
This paper introduces a learning method for two-layer feedforward neural networks based on sensitivity analysis, which uses a linear training algorithm for each of the two layers....
Enrique Castillo, Bertha Guijarro-Berdiñas,...