Results 21 to 30 of about 601,118 (351)

Computing the nearest euclidean distance matrix with low embedding dimensions [PDF]

open access: yes, 2013
Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate.
Qi, Hou-Duo, Yuan, Xiaoming, Qi, Hou Duo
core   +1 more source

Genalex-distance-matrix-and-PCA [PDF]

open access: yes, 2017
Distance matrix input file for the program GenAlEx, and output from PCA analysis using default ...
Oyler-McCance, Sara J.   +7 more
core   +1 more source

A semismooth newton method for the nearest Euclidean distance matrix problem [PDF]

open access: yes, 2013
The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter ...
Qi, Houduo
core   +1 more source

On the distance matrix of a tree

open access: yesDiscrete Mathematics, 1976
AbstractFor a tree T on n vertices, let D(T)=(dij) denote the distance matrix of T, i.e., dij(T) is just the length of the unique path then the ith vertex and the jth vertex of T. Denote by ΔT(x) the characteristic polynom, of D(T), so that ΔT(x) = det(D(T) xl). In this paper, we investigate a number of properties of ΔT(x).
M. Edelberg   +2 more
openaire   +1 more source

An algorithm for computing the distance to uncontrollability [PDF]

open access: yes, 1991
Elsner L, He C. An algorithm for computing the distance to uncontrollability. Systems & Control Letters. 1991;17(6):453-464.In this paper, we present an algorithm to compute the distance to uncontrollability.
He, Chunyang, Elsner, Ludwig
core   +2 more sources

The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue [PDF]

open access: yes, 2008
For a matrix polynomial P(λ) and a given complex number μ, we introduce a (spectral norm) distance from P(λ) to the matrix polynomials that have μ as an eigenvalue of geometric multiplicity at least κ, and a distance from P(λ) to the matrix polynomials ...
Papathanasiou, Nikolaos   +3 more
core   +1 more source

Distance matrix images. [PDF]

open access: yes, 2022
The supplemental data includes distance matrix images (grayscale, PNG format) and a Matlab script. (DOC)
Nuwan Tharanga Attygalle (12046997)   +1 more
core   +1 more source

Multi-distance support matrix machines [PDF]

open access: yesPattern Recognition Letters, 2019
Real-world data such as digital images, MRI scans and electroencephalography signals are naturally represented as matrices with structural information. Most existing classifiers aim to capture these structures by regularizing the regression matrix to be low-rank or sparse.
Yunfei Ye, Dong Han
openaire   +2 more sources

A note on completing quasi-distance and distance matrices

open access: yesSpecial Matrices, 2019
We give a necessary and sufficient condition for the existence of a quasi-distance matrix where some positive off-diagonal entries have been prescribed. Moreover, we give an algorithm for obtaining such a matrix.
Zhang Yulin   +2 more
doaj   +1 more source

Realizing the distance matrix of a graph [PDF]

open access: yes, 1966
An explicit description is given for the unique graph with as few arcs (each bearing a positive length) as possible, which has a prescribed matrix of shortest-path distances between pairs of distinct vertices.
Goldman, A. J.
core   +1 more source

Home - About - Disclaimer - Privacy