Sciweavers

1154 search results - page 5 / 231
» On the editing distance of graphs
Sort
View
ICIAP
2009
ACM
13 years 5 months ago
Tree Covering within a Graph Kernel Framework for Shape Classification
Abstract. Shape classification using graphs and skeletons usually involves edition processes in order to reduce the influence of structural noise. However, edition distances can no...
François-Xavier Dupé, Luc Brun
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
13 years 9 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
ICDAR
2011
IEEE
12 years 7 months ago
A Method of Evaluating Table Segmentation Results Based on a Table Image Ground Truther
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
Yanhui Liang, Yizhou Wang, Eric Saund
ICPR
2010
IEEE
14 years 2 months ago
Motion-Sketch Based Video Retrieval Using a Trellis Levenshtein Distance
We present a fast technique for retrieving video clips using free-hand sketched queries. Visual keypoints within each video are detected and tracked to form short trajectories, wh...
Rui Hu, John Philip Collomosse
IDEAL
2007
Springer
14 years 1 months ago
A New Dissimilarity Measure Between Trees by Decomposition of Unit-Cost Edit Distance
Abstract. Tree edit distance is a conventional dissimilarity measure between labeled trees. However, tree edit distance including unit-cost edit distance contains the similarity of...
Hisashi Koga, Hiroaki Saito, Toshinori Watanabe, T...