Sciweavers

1154 search results - page 21 / 231
» On the editing distance of graphs
Sort
View
KCAP
2003
ACM
14 years 1 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
ICALP
2004
Springer
14 years 2 months ago
Property Testing of Regular Tree Languages
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
Frédéric Magniez, Michel de Rougemon...
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
14 years 3 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
TKDE
2002
133views more  TKDE 2002»
13 years 8 months ago
ImageMap: An Image Indexing Method Based on Spatial Similarity
We introduce ImageMap, as a method for indexing and similarity searching in Image DataBases (IDBs). ImageMap answers "queries by example", involving any number of object...
Euripides G. M. Petrakis, Christos Faloutsos, King...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 7 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen