Sciweavers

53 search results - page 5 / 11
» A Fast Bit-Vector Algorithm for Approximate String Matching ...
Sort
View
SIGSOFT
2005
ACM
14 years 8 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 7 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
ICASSP
2009
IEEE
14 years 2 months ago
Document reconstruction using dynamic programming
In this work we propose a methodology for document reconstruction based on dynamic programming and a modified version of the Prim’s algorithm. Firstly, we use polygonal approxi...
Andre Pimenta, Edson J. R. Justino, Luiz S. Olivei...
CBMS
2006
IEEE
14 years 1 months ago
Pre-Indexing for Fast Partial Shape Matching of Vertebrae Images
Fast retrieval of images from large databases especially from large medical image databases is of great interest to researchers. We have developed shape-based image retrieval syst...
Xiaoqian Xu, D. J. Lee, Sameer Antani, L. Rodney L...
ICDAR
2003
IEEE
14 years 24 days ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton