Results 21 to 30 of about 270,219 (278)
Coding for interactive communication correcting insertions and deletions [PDF]
, 2016 We consider the question of interactive communication, in which two remote parties perform a computation while their communication channel is (adversarially) noisy. We extend here the discussion into a more general and stronger class of noise, namely, we
Braverman, Mark +3 more
core +2 more sources
Map Edit Distance vs. Graph Edit Distance for Matching Images [PDF]
, 2013 Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). Recently, we have introduced a map edit distance.
Combier, Camille +2 more
openaire +2 more sources
FEDS - Filtered Edit Distance Surrogate [PDF]
, 2021 ICDAR 2021 camera-ready ...
Yash Patel, Jiří Matas
openaire +2 more sources
Graph Edit Distance or Graph Edit Pseudo-Distance? [PDF]
, 2016 Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes of the involved graphs.
Francesc Serratosa +2 more
openaire +1 more source
Approximating the Geometric Edit Distance
Algorithmica, 2022 Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as signal analysis, bioinformatics, etc., need to be solved in a geometric space. Therefore, the geometric edit distance (GED) has been studied.
Kyle Fox, Xinyi Li
openaire +4 more sources
Recurrence analysis of extreme event-like data [PDF]
Nonlinear Processes in Geophysics, 2021 The identification of recurrences at various timescales in extreme event-like time series is challenging because of the rare occurrence of events which are separated by large temporal gaps.
A. Banerjee +11 more
doaj +1 more source
Graph edit distance from spectral seriation [PDF]
, 2005 This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance ...
Hancock, E R, Robles-Kelly, A
core +3 more sources
Similar Supergraph Search Based on Graph Edit Distance
Algorithms, 2021 Subgraph and supergraph search methods are promising techniques for the development of new drugs. For example, the chemical structure of favipiravir—an antiviral treatment for influenza—resembles the structure of some components of RNA.
Masataka Yamada, Akihiro Inokuchi
doaj +1 more source
The Edit Distance as a Measure of Perceived Rhythmic Similarity
Empirical Musicology Review, 2012 The ‘edit distance’ (or ‘Levenshtein distance’) measure of distance between two data sets is defined as the minimum number of editing operations – insertions, deletions, and substitutions – that are required to transform one data set to the other (Orpen ...
Olaf Post, Godfried Toussaint
doaj +1 more source
Edit distance measure for graphs [PDF]
Czechoslovak Mathematical Journal, 2015 The edit number \(s(G,F)\) of two graphs \(G,F\) of order \(n\) is the minimum number of edges needed to be added/deleted from the graph \(G\) to obtain a graph isomorphic to \(F\). In this paper, the author provides values and bounds for \(g(n,l)\), the maximum number \(k\) for which there are \(l\) graphs of order \(n\), each two having edit distance
Dzido, Tomasz, Krzywdziński, Krzysztof
openaire +2 more sources