Skip to search formSkip to main contentSkip to account menu

Distance matrix

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this report, we extend the notion of branching bisimulation to weighted systems, more speci cally weighted Kripke structures… 
2017
2017
INTRODUCTION Many occupations involve long-term standing in order to perform various tasks. Surgeons, retail clerks, hairdressers… 
2014
2014
Template matching adalah salah satu teknik dalam pengolahan citra digital yang berfungsi untuk mencocokkan tiap – tiap bagian… 
2009
2009
In this work we present a simple and fast approach to generate network structures based on time series recurrence plots and… 
2009
2009
In this thesis, we consider two combinatorial problems which are fundamental for many computational tasks, for example in… 
2008
2008
Shape matching should be invariant to the typical intra-class deformations present in nature. The majority of shape descriptors… 
2008
2008
We compare techniques for embedding a data set into Euclidean space under different notions of proximity constraints. 
2005
2005
This paper presents efficient algorithms for clone items detection in a binary relation. Best implementation of these algorithms… 
2002
2002
We consider the problem of preprocessing an edge-weighted directed graph G to answer queries that ask for the shortest distance… 
1988
1988