262 search results - page 5 / 53 » Approximating the 2-Interval Pattern Problem |
LATIN
1998
Springer
14 years 2 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...
LATIN
1998
Springer
14 years 2 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...
PAMI
2011
13 years 4 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
ESANN
2000
13 years 11 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
GBRPR
2005
Springer
14 years 3 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...