Stefano Fanelli

According to our database1, Stefano Fanelli authored at least 12 papers between 1980 and 2005.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Low-complexity minimization algorithms.
Numer. Linear Algebra Appl., 2005

2004
An Efficient Generalization of Battiti-Shanno's Quasi-Newton Algorithm for Learning in MLP-Networks.
Proceedings of the Neural Information Processing, 11th International Conference, 2004

2003
A new class of quasi-Newtonian methods for optimal learning in MLP-networks.
IEEE Trans. Neural Networks, 2003

Matrix algebras in Quasi-Newton methods for unconstrained minimization.
Numerische Mathematik, 2003

2001
Optimal Algorithms for Well-Conditioned Nonlinear Systems of Equations.
IEEE Trans. Computers, 2001

1998
An Application of ELISA to Perfect Hashing with Deterministic Ordering.
Proceedings of the Fifth International Conference on Neural Information Processing, 1998

1997
Terminal attractor algorithms: A critical analysis.
Neurocomputing, 1997

Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent.
Proceedings of the Progress in Connectionist-Based Information Systems: Proceedings of the 1997 International Conference on Neural Information Processing and Intelligent Information Systems, 1997

Suspiciousness of loading problems.
Proceedings of International Conference on Neural Networks (ICNN'97), 1997

1996
Exploring and comparing the best "direct methods" for the efficient training of MLP-networks.
IEEE Trans. Neural Networks, 1996

1981
An unresolved conjecture on nonmaximal planar graphical sequences.
Discret. Math., 1981

1980
On a conjecture on maximal planar sequences.
J. Graph Theory, 1980


  Loading...