Skip to search formSkip to main contentSkip to account menu
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… 
Wikipedia

Related topics

Related topics

41 relations
Adjacency matrixAlexandru BalabanAlignment-free sequence analysisBioinformatics
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
3D Human Pose Estimation from a Single Image via Distance Matrix Regression
  • 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… 
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Highly Cited
2016
Highly Cited
2016
Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets
The all-pairs-similarity-search (or similarity join) problem has been extensively studied for text and a handful of other… 
  • figure 2
  • figure 1
  • figure 3
  • table II
  • figure 6
Highly Cited
2013
Highly Cited
2013
Illumina metabarcoding of a soil fungal community
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2009
Highly Cited
2009
A simple and fast algorithm for K-medoids clustering
  • table 1
  • table 2
Review
2006
Review
2006
Distance Metric Learning: A Comprehensive Survey
Many machine learning algorithms, such as K Nearest Neighbor (KNN), heavily rely on the distance metric for the input data… 
  • table 1
  • figure 1
Highly Cited
2001
Highly Cited
2001
FITTING MULTIVARIATE MODELS TO COMMUNITY DATA: A COMMENT ON DISTANCE‐BASED REDUNDANCY ANALYSIS
Nonparametric multivariate analysis of ecological data using permutation tests has two main challenges: (1) to partition the… 
  • table 1
  • table 2
Highly Cited
1999
Highly Cited
1999
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… 
Highly Cited
1993
Highly Cited
1993
Euclidean Distance Matrix Analysis (EDMA): Estimation of mean form and mean form difference
Euclidean Distance Matrix Analysis (EDMA) of form is a coordinate free approach to the analysis of form using landmark data. In… 
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1985
Highly Cited
1985
Optimal Routing under Capacity and Distance Restrictions
This paper describes an integer linear programming algorithm for vehicle routing problems involving capacity and distance… 
Highly Cited
1960
Highly Cited
1960
Integer Programming Formulation of Traveling Salesman Problems
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE