Results 11 to 20 of about 1,791,230 (278)
Edit Distance for Pushdown Automata [PDF]
Logical Methods in Computer Science, 2015 The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$. The edit distance generalizes to languages $\mathcal{L}_1, \mathcal{L}_2$, where the edit distance from $\mathcal{L}_1$ to $\mathcal{L}_2$ is the minimal number $k$ such that ...
Chatterjee, Krishnendu +3 more
core +13 more sources
2018 24th International Conference on Pattern Recognition (ICPR), 2018 In this paper, we present a novel distance metric called Segmentation Edit Distance (SED) and its use as a segmentation evaluation metric. In segmentation evaluation, the difference or distance of a test segmentation and the associated ground truth segmentation are measured in order to compare different algorithms.
Daniel Pucher, Walter G. Kropatsch
core +7 more sources
Approximating Tree Edit Distance through String Edit Distance [PDF]
Algorithmica, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tatsuya Akutsu +2 more
openaire +6 more sources
A dynamic edit distance table [PDF]
Journal of Discrete Algorithms, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sung-Ryul Kim, Kunsoo Park
openaire +4 more sources
Edit Distance with Block Deletions [PDF]
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +3 more sources
CoRRWe define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ>0$, we seek the minimum number of edits to $σ$ such that the Fréchet distance between the edited $σ$ and $π$ is at most $δ$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices,
Emily Fox +3 more
openaire +6 more sources
Edit distance for timed automata [PDF]
Proceedings of the 17th international conference on Hybrid systems: computation and control, 2014 The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory ...
Krishnendu Chatterjee +2 more
openaire +4 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.
Camille Combier +2 more
openaire +3 more sources
On the editing distance of graphs [PDF]
Journal of Graph Theory, 2008 AbstractAn edge‐operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from G to $\cal G$ is the smallest number of edge‐operations needed to modify G into a graph from $\cal G$.
Maria Axenovich +2 more
openaire +5 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 +3 more sources