Results 21 to 30 of about 596,753 (209)
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
Transactions on Combinatorics, 2023 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
Multi-distance support matrix machines [PDF]
Pattern 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
Special 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
Euclidean distance matrix completion
, 2021 Matrizes de distâncias Euclidianas são ferramentas importantes para a área de geometria de distâncias. Já faz muito tempo que estudam-se o problema de identificar se uma matriz é ou não uma matriz de distâncias Euclidianas e o problema de encontrar ...
Marcondes, Diaulas Murize Santana Vieira
core +1 more source
Use of Dynamic Time Warping for Description of Combustion Process in a Biomass Boiler
Acta Technologica Agriculturae, 2022 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
On Matrix Nearness Problems: Distance to Delocalization [PDF]
SIAM Journal on Matrix Analysis and Applications, 2015 This paper introduces two new matrix nearness problems that are intended to generalize the distance to instability and the distance to stability. They are named the distance to delocalization and the distance to localization due to their applicability in analyzing the robustness of eigenvalues with respect to arbitrary localization sets (domains) in ...
Vladimir R. Kostic +2 more
openaire +3 more sources
Stress of a graph and its computation
AKCE International Journal of Graphs and Combinatorics, 2023 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
On the distance eigenvalues of Cayley graphs
پژوهشهای ریاضی, 2022 In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj
Determining finite connected graphs along the quadratic embedding constants of paths
Electronic Journal of Graph Theory and Applications, 2021 The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Edy Tri Baskoro, Nobuaki Obata
doaj +1 more source
Bounds for the Distance to the Nearest Correlation Matrix [PDF]
SIAM Journal on Matrix Analysis and Applications, 2016 Summary: In a wide range of practical problems correlation matrices are formed in such a way that, while symmetry and a unit diagonal are ensured, they may lack semidefiniteness. We derive a variety of new upper bounds for the distance from an arbitrary symmetric matrix to the nearest correlation matrix.
Nicholas J. Higham, Natasa Strabic
openaire +3 more sources