Results 291 to 300 of about 4,837,596 (345)
Some of the next articles are maybe not open access.
Channel Charting: an Euclidean Distance Matrix Completion Perspective
IEEE International Conference on Acoustics, Speech, and Signal Processing, 2020Channel charting (CC) is an emerging machine learning framework that aims at learning lower-dimensional representations of the radio geometry from collected channel state information (CSI) in an area of interest, such that spatial relations of the ...
Patrick Agostini +2 more
semanticscholar +1 more source
Journal of Computational Chemistry, 2010
AbstractWe have introduced novel distance matrix for graphs, which is based on interpretation of columns of the adjacency matrix of a graph as a set of points in n‐dimensional space, n being the number of vertices in the graph. Numerical values for the distances are based on the Euclidean distance between n points in n‐dimensional space.
Randić, Milan +3 more
openaire +4 more sources
AbstractWe have introduced novel distance matrix for graphs, which is based on interpretation of columns of the adjacency matrix of a graph as a set of points in n‐dimensional space, n being the number of vertices in the graph. Numerical values for the distances are based on the Euclidean distance between n points in n‐dimensional space.
Randić, Milan +3 more
openaire +4 more sources
The distance matrix in chemistry
Journal of Mathematical Chemistry, 1992The graph-theoretical (topological) distance matrix and the geometric (topographic) distance matrix and their invariants (polynomials, spectra, determinants and Wiener numbers) are presented. Methods of computing these quantities are discussed. The uses of the distance matrix in both forms and the related invariants in chemistry are surveyed.
Mihalić, Zlatko +5 more
openaire +2 more sources
Deriving an Amino Acid Distance Matrix
Journal of Theoretical Biology, 1993Various methods were investigated to convert an amino acid similarity matrix into a low-dimensional, metric distance matrix. Using projection techniques, no unique transformation was found and of the many inversion forms investigated, simple negation normalized by the diagonal elements produced a good fit to the original data.
W R, Taylor, D T, Jones
openaire +2 more sources
The Distance Randić Matrix of Connected Graphs
Bulletin of the Brazilian Mathematical Society, New Series, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Díaz, Roberto C., Rojo, Oscar
openaire +2 more sources
The Euclidian Distance Matrix Completion Problem
SIAM Journal on Matrix Analysis and Applications, 1995Motivated by the molecular mapping (or ``conformation'') problem, i.e., the problem of deducing the possible shapes of a molecule from partial (or inaccurate) information about interatomic distances, the authors study the completions of partial Euclidean distance matrices, i.e., the choice of values for each of the unspecified entries, resulting in a ...
Bakonyi, Mihály, Johnson, Charles R.
openaire +2 more sources
Euclidean Distance Matrix Optimization for Sensor Network Localization *
Cooperative Localization and Navigation, 2019Sensor Network Localization (SNL) is a general framework that generates a set of embedding points in a low-dimensional space so as to preserve given distance information as much as possible.
J. Fliege, H. Qi, N. Xiu
semanticscholar +1 more source
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
IEEE International Joint Conference on Neural Network, 2018
In this paper we discuss techniques for potential speedups in $k$-medoids clustering. Specifically, we address the advantages of pre-caching the pairwise distance matrix, heart of the $k$-medoids clustering algorithm, not only in order to speedup the ...
A. Martino, A. Rizzi, F. Mascioli
semanticscholar +1 more source
In this paper we discuss techniques for potential speedups in $k$-medoids clustering. Specifically, we address the advantages of pre-caching the pairwise distance matrix, heart of the $k$-medoids clustering algorithm, not only in order to speedup the ...
A. Martino, A. Rizzi, F. Mascioli
semanticscholar +1 more source
Distance-based support vector machine to predict DNA N6-methyladenine modification
Current Bioinformatics, 2022DNA N6-methyladenine plays an important role in the restriction-modification system to isolate invasion from adventive DNA. The shortcomings of the high time-consumption and high costs of experimental methods have been exposed, and some computational ...
Haoyu Zhang +4 more
semanticscholar +1 more source