415 search results - page 8 / 83 » New Results for the 2-Interval Pattern Problem |
CPM
1999
Springer
14 years 5 days ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
LATIN
1998
Springer
14 years 3 days 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...
MLDM
2009
Springer
14 years 2 months ago
2009
Springer
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
The small sample size problem is often encountered in pattern recognition. It results in the singularity of the within-class scatter matrix Sw in Linear Discriminant Analysis (LDA...