910 search results - page 59 / 182 » Detecting False Matches in String Matching Algorithms |
144
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
141
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
138
click to vote
CBMS
2006
IEEE
15 years 9 months ago
2006
IEEE
More and more ontologies are emerging across bioinformatics domains to represent and define domain knowledge, such as gene ontology, anatomy ontology and disease ontology. To inte...
143
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a new model to overcome the occlusion problems coming from wide baseline multiple camera stereo. Rather than explicitly modeling occlusions in the matching cos...
128
click to vote
PSIVT
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we consider the grayscale template-matching problem, invariant to rotation, scale, translation, brightness and contrast, without previous operations that discard gra...