Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Distance matrix

In mathematics, computer science and especially graph theory, a distance matrix is a matrix (two-dimensional array) containing the distances, taken… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
  • F. Moreno-Noguer
  • IEEE Conference on Computer Vision and Pattern…
  • 2017
  • Corpus ID: 17035965
This paper addresses the problem of 3D human pose estimation from a single image. We follow a standard two-step pipeline by first… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Abstract Next generation metabarcoding is becoming an indispensable tool in fungal community ecology. Here we tested Illumina… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Abstract We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected graph, called the distance… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D, and the D-energy ED(G) is the sum of the absolute… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider distance matrices of certain graphs and of points chosen in a rectangular grid. Formulae for the inverse and the… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Nonparametric multivariate analysis of ecological data using permutation tests has two main challenges: (1) to partition the… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The genetic base of soybean [Glycine max (L.) Merr.] cultivars developed for North America is very narrow. This may threaten the… Expand
  • table 1
  • table 1
  • table 2
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… Expand
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Abstract Let G be a finite connected graph. If x and y are vertices of G , one may define a distance function d G on G by letting… Expand
  • figure 5
  • figure 6
  • figure 8
  • figure 9
  • figure 18
Is this relevant?
Highly Cited
1960
Highly Cited
1960
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems… Expand
Is this relevant?