Pages that link to "Item:Q1102346"

The following pages link to On certain linear mappings between inner-product and squared-distance matrices (Q1102346):

Displaying 33 items.

• On cell matrices: a class of Euclidean distance matrices (Q275228) (← links)
• The walk distances in graphs (Q427888) (← links)
• Universal rigidity of bar frameworks via the geometry of spectrahedra (Q522288) (← links)
• Wasserstein distances in the analysis of time series and dynamical systems (Q617532) (← links)
• Iterative denoising (Q626230) (← links)
• Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix (Q726657) (← links)
• Combining dissimilarity matrices by using rank correlations (Q736597) (← links)
• Equality relating Euclidean distance cone to positive semidefinite cone (Q924334) (← links)
• Sensitivity analysis of the strain criterion for multidimensional scaling (Q959142) (← links)
• The out-of-sample problem for classical multidimensional scaling (Q1023816) (← links)
• The embedding problem for predistance matrices (Q1176717) (← links)
• A genetic algorithm for circulant Euclidean distance matrices (Q1294348) (← links)
• Distance matrices and regular figures (Q1316171) (← links)
• An optimization problem on subsets of the symmetric positive-semidefinite matrices (Q1321430) (← links)
• On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
• On yielding and jointly yielding entries of Euclidean distance matrices (Q1668992) (← links)
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
• Extensions of classical multidimensional scaling via variable reduction (Q1855631) (← links)
• Better initial configurations for metric multidimensional scaling (Q1874126) (← links)
• Uniqueness of the solutions of some completion problems (Q1887497) (← links)
• Connections between the real positive semidefinite and distance matrix completion problems (Q1894505) (← links)
• Circum-Euclidean distance matrices and faces (Q1906789) (← links)
• Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
• On representations of graphs as two-distance sets (Q2279265) (← links)
• On unit spherical Euclidean distance matrices which differ in one entry (Q2310405) (← links)
• On dimensional rigidity of bar-and-joint frameworks (Q2370423) (← links)
• Inverse eigenvalue problem of distance matrix via orthogonal matrix (Q2448239) (← links)
• On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices (Q2494668) (← links)
• Block matrices and multispherical structure of distance matrices (Q2564954) (← links)
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
• The cone of distance matrices (Q2639130) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• A facial reduction approach for the single source localization problem (Q6064050) (← links)