Sciweavers

1154 search results - page 19 / 231
» On the editing distance of graphs
Sort
View
PVLDB
2010
195views more  PVLDB 2010»
13 years 3 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
14 years 2 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
SEMWEB
2007
Springer
14 years 2 months ago
Structure Preserving Semantic Matching
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
SIGMOD
2005
ACM
194views Database» more  SIGMOD 2005»
14 years 2 months ago
STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
CVPR
2007
IEEE
14 years 10 months ago
Layered Graph Match with Graph Editing
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
Liang Lin, Song Chun Zhu, Yongtian Wang