26 search results - page 1 / 6 » Improved Approximate Pattern Matching on Hypertext |
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
IMC
2006
ACM
13 years 11 months ago
2006
ACM
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
NAACL
1994
13 years 6 months ago
1994
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...