Francesco Romani

Appl. Math. Comput., 2019

Adaptive Clustering via Symmetric Nonnegative Matrix Factorization of the Similarity Matrix.

[BibT_eX]

[DOI]

Algorithms, 2019

An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions.

[BibT_eX]

[DOI]

Algorithms, 2019

2018

Image regularization by nonnegatively constrained Conjugate Gradient.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2016

A multi-class approach for ranking graph nodes: Models and experiments with incomplete data.

[BibT_eX]

[DOI]

Inf. Sci., 2016

An Adaptive Matrix Factorization Approach for Personalized Recommender Systems.

[BibT_eX]

[DOI]

CoRR, 2016

2014

Generalized Cross-Validation applied to Conjugate Gradient for discrete ill-posed problems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

2011

A Coupled Model for the Indegree and Outdegree Analysis of the Web.

[BibT_eX]

[DOI]

Internet Math., 2011

2010

A combined approach for evaluating papers, authors and scientific journals.

[BibT_eX]

[DOI]

Dario Bini

J. Comput. Appl. Math., 2010

2009

A time-aware citation-based model for evaluating scientific products: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, 2009

2007

A Stochastic Model for the Link Analysis of the Web.

[BibT_eX]

[DOI]

Internet Math., 2007

Simulation Models and Implementation of a Simulator for the Performability Analysis of Electric Power Systems Considering Interdependencies.

[BibT_eX]

[DOI]

Silvano Chiaradonna

Felicita Di Giandomenico

Luca Simoncini

Proceedings of the Tenth IEEE International Symposium on High Assurance Systems Engineering (HASE 2007), 2007

2005

Fast PageRank Computation via a Sparse Linear System.

[BibT_eX]

[DOI]

Antonio Gulli

Internet Math., 2005

Ranking a stream of news.

[BibT_eX]

[DOI]

Antonio Gulli

Proceedings of the 14th international conference on World Wide Web, 2005

2004

Fast PageRank Computation Via a Sparse Linear System (Extended Abstract).

[BibT_eX]

[DOI]

Antonio Gulli

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

2002

Railway Computation for Infinite Linear Systems.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 2002

2001

Heuristic Spectral Techniques for the Reduction of Bandwidth and Work-Bound of Sparse Matrices.

[BibT_eX]

[DOI]

Numer. Algorithms, 2001

2000

Separable asymptotic cost of evaluating elementary functions.

[BibT_eX]

[DOI]

Numer. Algorithms, 2000

1999

An infinite precision bracketing algorithm with guaranteed convergence.

[BibT_eX]

[DOI]

Numer. Algorithms, 1999

1997

Local Error Estimates and Regularity Tests for the Implementation of Double Adaptive Quadrature.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1997

1994

Asymptotic Behavior of Automatic Quadrature.

[BibT_eX]

[DOI]

J. Complex., 1994

1991

Algorithm 691: Improving QUADPACK automatic integration routines.

[BibT_eX]

[DOI]

Paola Favati

ACM Trans. Math. Softw., 1991

Interpolatory integration formulas for optimal composition.

[BibT_eX]

[DOI]

Paola Favati

ACM Trans. Math. Softw., 1991

VLSI implementation of the capacitance matrix method.

[BibT_eX]

[DOI]

Paola Favati

Integr., 1991

1990

Area-Time Trade-Offs for Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1990

1987

A compact and modular VLSI design for the solution of general sparse linear systems.

[BibT_eX]

[DOI]

Integr., 1987

1985

VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1985

VLSI implementation of iterative methods for the solution of linear systems.

[BibT_eX]

[DOI]

Integr., 1985

1983

On the Asymptotic Complexity of Rectangular Matrix Multiplication.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

1982

Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

1981

Author's Reply to S. Moran's Note on the Shortest Path Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

Application of Approximating Algorithms to Boolean Matrix Multiplication.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1980

Approximate Solutions for the Bilinear Form Computational Problem.

[BibT_eX]

[DOI]

Dario Bini

SIAM J. Comput., 1980

Shortest-Path Problem is not Harder Than Matrix Multiplication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

1979

O(n<sup>2.7799</sup>) Complexity for n*n Approximate Matrix Multiplication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

1978

The Parallelism Principle: Speeding Up the Cellular Automata Synchronization

[BibT_eX]

[DOI]

Inf. Control., March, 1978

1977

On the fast synchronization of tree connected networks.

[BibT_eX]

[DOI]

Inf. Sci., 1977

1976

Cellular automata synchronization.

[BibT_eX]

[DOI]