Sciweavers

1154 search results - page 11 / 231
» On the editing distance of graphs
Sort
View
ACL
2009
13 years 6 months ago
Automatic Cost Estimation for Tree Edit Distance Using Particle Swarm Optimization
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
Yashar Mehdad
PVLDB
2008
201views more  PVLDB 2008»
13 years 8 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
CP
2009
Springer
14 years 9 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
IPPS
2002
IEEE
14 years 1 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
BIBE
2000
IEEE
110views Bioinformatics» more  BIBE 2000»
14 years 7 days ago
FURY: Fuzzy Unification and Resolution Based on Edit Distance
We present a theoretically founded framework for fuzzy unification and resolution based on edit distance over trees. Our framework extends classical unification and resolution con...
David Gilbert, Michael Schroeder