Sciweavers

125 search results - page 16 / 25
» Cross-Domain Approximate String Matching
Sort
View
PAMI
2012
13 years 2 months ago
LDAHash: Improved Matching with Smaller Descriptors
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
Christoph Strecha, Alexander A. Bronstein, Michael...
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
15 years 4 months ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
CPM
2000
Springer
124views Combinatorics» more  CPM 2000»
15 years 4 months ago
Indexing Text with Approximate q-Grams
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jor...
MJ
2006
138views more  MJ 2006»
14 years 11 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
ICDAR
2011
IEEE
13 years 11 months ago
Word Retrieval in Historical Document Using Character-Primitives
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
Partha Pratim Roy, Jean-Yves Ramel, Nicolas Ragot