Sciweavers

1154 search results - page 8 / 231
» On the editing distance of graphs
Sort
View
MIAR
2006
IEEE
14 years 2 months ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
Tommy W. H. Tang, Albert C. S. Chung
ICMCS
2005
IEEE
162views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Clustering of Video Objects by Graph Matching
We propose a new graph-based data structure, called Spatio Temporal Region Graph (STRG) which can represent the content of video sequence. Unlike existing ones which consider main...
JeongKyu Lee, Jung-Hwan Oh, Sae Hwang
ISM
2006
IEEE
129views Multimedia» more  ISM 2006»
13 years 8 months ago
A Graph-Based Approach for Modeling and Indexing Video Data
In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new g...
JeongKyu Lee
ICML
1997
IEEE
14 years 9 months ago
Learning String Edit Distance
Eric Sven Ristad, Peter N. Yianilos
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 9 months ago
A sublinear algorithm for weakly approximating edit distance
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
Tugkan Batu, Funda Ergün, Joe Kilian, Avner M...