Sciweavers

122 search results - page 11 / 25
» The approximability of the String Barcoding problem
Sort
View
ICDAR
2009
IEEE
13 years 5 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
DSD
2005
IEEE
123views Hardware» more  DSD 2005»
14 years 1 months ago
Hardware-Based Implementation of the Common Approximate Substring Algorithm
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
Kenneth B. Kent, Sharon Van Schaick, Jacqueline E....
CIKM
1997
Springer
14 years 1 days ago
Applications of Approximate Word Matching in Information Retrieval
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
James C. French, Allison L. Powell, Eric Schulman
ICDAR
1999
IEEE
14 years 5 days ago
Models and Algorithms for Duplicate Document Detection
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
Daniel P. Lopresti
ISPAN
1997
IEEE
14 years 2 days ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal