1154 search results - page 59 / 231 » On the editing distance of graphs |
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
SSDBM
2003
IEEE
14 years 2 months ago
2003
IEEE
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
EUROGP
2006
Springer
14 years 13 days ago
2006
Springer
This paper extends a geometric framework for interpreting crossover and mutation [4] to the case of sequences. This representation is important because it is the link between artif...
TASLP
2008
13 years 8 months ago
2008
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
CAIP
2009
Springer
14 years 23 days ago
2009
Springer
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...