Sciweavers

103 search results - page 1 / 21
» Dynamic programming matching for large scale information ret...
Sort
View
IRAL
2003
ACM
13 years 10 months ago
Dynamic programming matching for large scale information retrieval
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
Eiko Yamamoto, Masahiro Kishida, Yoshinori Takenam...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 9 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
MM
2005
ACM
179views Multimedia» more  MM 2005»
13 years 10 months ago
Automatic identification of digital video based on shot-level sequence matching
To locate a video clip in large collections is very important for retrieval applications, especially for digital rights management. In this paper, we present a novel technique for...
Jian Zhou, Xiao-Ping Zhang
TITB
2008
111views more  TITB 2008»
13 years 4 months ago
A Spine X-Ray Image Retrieval System Using Partial Shape Matching
In recent years, there has been a rapid increase in the size and number of medical image collections. Thus, the development of appropriate methods for medical information retrieval...
Xiaoqian Xu, Dah-Jye Lee, Sameer Antani, L. Rodney...
DAS
2010
Springer
13 years 9 months ago
Towards more effective distance functions for word image matching
Matching word images has many applications in document recognition and retrieval systems. Dynamic Time Warping (DTW) is popularly used to estimate the similarity between word imag...
Raman Jain, C. V. Jawahar