Results 291 to 300 of about 2,194,803 (325)
Some of the next articles are maybe not open access.
The distance matrix of caterpillar
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joice S. do Nascimento +2 more
openaire +1 more source
Preconditioners for distance matrix algorithms
Journal of Computational Chemistry, 1994AbstractA recent gradient algorithm in nonlinear optimization uses a novel idea that avoids line searches. This so‐called spectral gradient algorithm works well when the spectrum of the Hessian of the function to be minimized has a small range or is clustered. In this article, we find a general preconditioning method for this algorithm.
W. Glunt, T. L. Hayden, M. Raydan
openaire +1 more source
Distance Matrix Completion by Numerical Optimization
Computational Optimization and Applications, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Nearest Neighbour Distance Matrix Classification
2010A distance based classification is one of the popular methods for classifying instances using a point-to-point distance based on the nearest neighbour or k-NEAREST NEIGHBOUR (k-NN). The representation of distance measure can be one of the various measures available (e.g.
Sainin, Mohd Shamrie, Alfred, Rayner
openaire +2 more sources
Euclidean distance matrix completion problems
Optimization Methods and Software, 2012Our experiments show that the method easily solves the artificial problems introduced by More and Wu. It also solves the 12 much more difficult protein fragment problems introduced by Hendrickson, and the six larger protein problems introduced by Grooms, Lewis and Trosset.
Haw-ren Fang, Dianne P. O'Leary
openaire +1 more source
[Reconstruction of genetic distance matrix].
Genetika, 1990A method for reconstruction of genetic distances' matrix, based on linear combination of physical distances' matrices among populations and mean sizes of the population matrices is proposed. The analogue of genetic distances' matrix obtained correlates with the matrix at the level 0.59.
G I, El'chinova +2 more
openaire +1 more source
Distance-Based Logistic Matrix Factorization
Neural ComputationAbstract Matrix factorization is a central paradigm in matrix completion and collaborative filtering. Low-rank factorizations have been extremely successful in reconstructing and generalizing high-dimensional data in a wide variety of machine learning problems from drug-target discovery to music recommendations.
Anoop Praturu, Tatyana O. Sharpee
openaire +1 more source
Journal of Chemical Information and Computer Sciences, 1994
Milan Randic +2 more
openaire +1 more source
Milan Randic +2 more
openaire +1 more source
2014
The classical distance between two vertices of a graph, which is defined to be the length of the shortest path, is often intuitively not appealing, and is also not tractable mathematically. The resistance distance between two vertices is defined to be the effective resistance between the vertices, when the graph is viewed as an electrical network, with
openaire +1 more source
The classical distance between two vertices of a graph, which is defined to be the length of the shortest path, is often intuitively not appealing, and is also not tractable mathematically. The resistance distance between two vertices is defined to be the effective resistance between the vertices, when the graph is viewed as an electrical network, with
openaire +1 more source
The biofilm matrix: multitasking in a shared space
Nature Reviews Microbiology, 2022Hans-Curt Flemming +2 more
exaly