Stefano Fanelli

12 papers B 2Journal 8Unranked 2
YearRankTypeTitle / Venue / Authors
2005 J jnl
Low-complexity minimization algorithms.
Numer. Linear Algebra Appl.
Carmine Di Fiore, Stefano Fanelli, Paolo Zellini
2004 B conf
An Efficient Generalization of Battiti-Shanno's Quasi-Newton Algorithm for Learning in MLP-Networks.
ICONIP
Carmine Di Fiore, Stefano Fanelli, Paolo Zellini
2003 J jnl
A new class of quasi-Newtonian methods for optimal learning in MLP-networks.
IEEE Trans. Neural Networks
Alessandro Bortoletti, Carmine Di Fiore, Stefano Fanelli, Paolo Zellini
2003 J jnl
Matrix algebras in Quasi-Newton methods for unconstrained minimization.
Numerische Mathematik
Carmine Di Fiore, Stefano Fanelli, Filomena Lepore, Paolo Zellini
2001 J jnl
Optimal Algorithms for Well-Conditioned Nonlinear Systems of Equations.
IEEE Trans. Computers
Monica Bianchini, Stefano Fanelli, Marco Gori
1998 B conf
An Application of ELISA to Perfect Hashing with Deterministic Ordering.
ICONIP
Monica Bianchini, Stefano Fanelli, Marco Gori
1997 — conf
Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent.
ICONIP (1)
Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi
1997 — conf
Suspiciousness of loading problems.
ICNN
Paolo Frasconi, Marco Gori, Stefano Fanelli, Marco Protasi
1997 J jnl
Terminal attractor algorithms: A critical analysis.
Neurocomputing
Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Maggini
1996 J jnl
Exploring and comparing the best "direct methods" for the efficient training of MLP-networks.
IEEE Trans. Neural Networks
M. Di Martino, Stefano Fanelli, Marco Protasi
1981 J jnl
An unresolved conjecture on nonmaximal planar graphical sequences.
Discret. Math.
Stefano Fanelli
1980 J jnl
On a conjecture on maximal planar sequences.
J. Graph Theory
Stefano Fanelli