Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,097,855 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
41 relations
Adjacency matrix
Alexandru Balaban
Alignment-free sequence analysis
Bioinformatics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Weighted Branching Systems : Behavioural Equivalence , Metric Structure , and their Characterisations Mathias Claus Jensen ?
M. C. Jensen
,
R. Mardare
2018
Corpus ID: 2854727
In this report, we extend the notion of branching bisimulation to weighted systems, more speci cally weighted Kripke structures…
Expand
2017
2017
EFFECT OF KNEE ROTATIONS ON ARTICULAR CARTILAGE COMPRESSION DURING KNEE FLEXION EXERCISE
E. Bottorff
,
Stephanie Wiltman
,
A. Chambers
2017
Corpus ID: 21687
INTRODUCTION Many occupations involve long-term standing in order to perform various tasks. Surgeons, retail clerks, hairdressers…
Expand
2014
2014
DETEKSI KERUSAKAN JALUR PCB MENGGUNAKAN METODE TEMPLATE MATCHING
Wahyu Nugroho
2014
Corpus ID: 109432501
Template matching adalah salah satu teknik dalam pengolahan citra digital yang berfungsi untuk mencocokkan tiap – tiap bagian…
Expand
2012
2012
Network analysis on safety culture and worker‘sbehaviour : A forest of all minimum spanningtrees
M. A. Djauhari
,
Shamshuritawati Sharif
,
H. Djauhari
2012
Corpus ID: 18594155
In this paper safety culture and worker’s are considered, all together, as a complex system and statistically represented in the…
Expand
2009
2009
From Complex Networks to Time Series Analysis and Viceversa: Application to Metabolic Networks
S. Fernanda
,
Zaldivar Comenges Jose
,
Poljansek Karmen
,
Bono Flavio
,
G. Eugenio
2009
Corpus ID: 11831183
In this work we present a simple and fast approach to generate network structures based on time series recurrence plots and…
Expand
2009
2009
Complexity analysis of tries and spanning tree problems
B. Eckhardt
2009
Corpus ID: 10945464
In this thesis, we consider two combinatorial problems which are fundamental for many computational tasks, for example in…
Expand
2008
2008
Matching 2 D & 3 D Articulated Shapes using Eccentricity
Adrian Ion
,
N. Artner
,
G. Peyré
,
W. Kropatsch
,
L. Cohen
2008
Corpus ID: 15316027
Shape matching should be invariant to the typical intra-class deformations present in nature. The majority of shape descriptors…
Expand
2008
2008
Distance Metric Learning from Pairwise Proximities
Brian McFee
2008
Corpus ID: 3200832
We compare techniques for embedding a data set into Euclidean space under different notions of proximity constraints.
2002
2002
Oracles for Distances Avoiding a Node or Link Failure ∗
C. Demetrescu
,
M. Thorup
,
R. Chowdhury
,
V. Ramachandran
2002
Corpus ID: 15811691
We consider the problem of preprocessing an edge-weighted directed graph G to answer queries that ask for the shortest distance…
Expand
1996
1996
Explicit N-Best Formant Features for Segment-Based Speech Recognition
Philipp Schmid
,
E. Barnard
1996
Corpus ID: 59694298
This thesis investigates the use of explicit speech knowledge in computer speech-recognition. Speech knowledge is generally…
Expand