Results 11 to 20 of about 547,023 (266)
Product distance matrix of a graph and squared distance matrix of a tree [PDF]
Let G be a strongly connected, weighted directed graph. We define a product distance ?(i,j) for pairs i,j of vertices and form the corresponding product distance matrix. We obtain a formula for the determinant and the inverse of the product distance matrix.
BAPAT, RB, SIVASUBRAMANIAN, S
openaire +2 more sources
Random matrix-improved estimation of covariance matrix distances [PDF]
Given two sets $x_1^{(1)},\ldots,x_{n_1}^{(1)}$ and $x_1^{(2)},\ldots,x_{n_2}^{(2)}\in\mathbb{R}^p$ (or $\mathbb{C}^p$) of random vectors with zero mean and positive definite covariance matrices $C_1$ and $C_2\in\mathbb{R}^{p\times p}$ (or $\mathbb{C}^{p\times p}$), respectively, this article provides novel estimators for a wide range of distances ...
Couillet, Romain +3 more
openaire +3 more sources
Ergodicity of project management system
The structures effectiveness of project management depends on two factors: parametric properties that reflect the properties of separate elements (or processes), structural properties of system that reflect the influence of elements interconnections on ...
Kateryna V. Kolesnikova +3 more
doaj +1 more source
Vehicle Routing Optimization System with Smart Geopositioning Updates
Solving the vehicle routing problem (VRP) is one of the best-known optimization issues in the TLS (transport, logistic, spedition) branch market. Various variants of the VRP problem have been presented and discussed in the literature for many years.
Radosław Belka, Mateusz Godlewski
doaj +1 more source
Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
Peer ...
openaire +3 more sources
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +1 more source
A note on completing quasi-distance and distance matrices
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
Use of Dynamic Time Warping for Description of Combustion Process in a Biomass Boiler
The efficient biomass energy use is a key prerequisite for the implementation of renewable energy development strategies on a regional level. For the highly efficient energy use in the combustion process, it is necessary to properly regulate the process ...
Kucín Martin +3 more
doaj +1 more source
Max–min distance nonnegative matrix factorization
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples.
Wang, Jim Jing-Yan, Gao, Xin
openaire +3 more sources
Stress of a graph and its computation
Stress is a centrality measure determined by the shortest paths passing through the given vertex. Noting that adjacency matrix playing an important role in finding the distance and the number of shortest paths between given pair of vertices, an ...
Raksha Poojary +3 more
doaj +1 more source

