1862 search results - page 65 / 373 » Constrained pattern matching |
104
Voted
IPL
2008
15 years 20 days ago
2008
![Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time")
Given two strings, a pattern P of length m and a text T of length n over some alphabet , we consider the string matching problem under k mismatches. The well
73
Voted
ICASSP
2007
IEEE
15 years 7 months ago
2007
IEEE
A method to establish correspondences between regions belonging to independent segmentations of multiple views of a scene is presented. The trade-off between color similarity and ...
119
click to vote
VL
1994
IEEE
15 years 4 months ago
1994
IEEE
Dotplot is a technique for visualizing patterns of string matches in millions of lines of text and code. Patterns may be explored interactively or detected automatically. Applicat...
75
Voted
CSB
2003
IEEE
15 years 6 months ago
2003
IEEE
A new pattern filtering technique is developed to analyze the genomic sequence in this research based on gap sequences, in which the distance of the same symbol is recorded consec...
121
Voted
ESANN
2004
15 years 2 months ago
2004
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...