Sciweavers

318 search results - page 30 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Shape Matching by Segmentation Averaging
We use segmentations to match images by shape. To address the unreliability of segmentations, we give a closed form approximation to an average over all segmentations. Our techniqu...
Hongzhi Wang, John Oliensis
ICPR
2004
IEEE
15 years 10 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
88
Voted
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
15 years 1 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
EDBT
2008
ACM
178views Database» more  EDBT 2008»
15 years 9 months ago
Compacting music signatures for efficient music retrieval
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
Bin Cui, H. V. Jagadish, Beng Chin Ooi, Kian-Lee T...
MMAS
2011
Springer
14 years 11 days ago
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
Björn Engquist, Lexing Ying