# Distance matrix

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- IEEE Transactions on Image Processing
- 2012

In this brief, we propose a novel contour-based shape descriptor, called the multiscale distance matrix, to capture the shape… (More)

Is this relevant?

2011

2011

- IEEE Conference on Decision and Control and…
- 2011

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a… (More)

Is this relevant?

2010

2010

- Journal of Computational Chemistry
- 2010

We have introduced novel distance matrix for graphs, which is based on interpretation of columns of the adjacency matrix of a… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- MELT
- 2008

We study Semidefinite Programming, SDP, relaxations for Sensor Network Localization, SNL, with anchors and with noisy distance… (More)

Is this relevant?

2005

2005

- 2005

INTRODUCTION The Theory of Distance Geometry [1] allows coordinate-free formulations for most position analysis problems. Using… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Bioinformatics
- 2003

MOTIVATION
Most existing approaches for phylogenetic inference use multiple alignment of sequences and assume some sort of an… (More)

Is this relevant?

2000

2000

- Comp. Opt. and Appl.
- 2000

Consider the problem of determining whether or not a partial dissimilarity matrix can be completed to a Euclidean distance matrix… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Comp. Opt. and Appl.
- 1999

Given a partial symmetric matrixA with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- 1985

A distance matrix D of order n is symmetric with elements idfj, where d,, = 0. D is Euclidean when the in(n 1) quantities dij can… (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- 1978

Let G be a finite connected graph. If x and y are vertices of G, one may define a distance function d, on G by letting d&x, y) be… (More)

Is this relevant?