541 search results - page 26 / 109 » An Efficient Algorithm for the Longest Pattern Subsequence P... |
EDBT
2006
ACM
14 years 9 months ago
2006
ACM
Abstract. Mobile objects have become ubiquitous in our everyday lives, ranging from cellular phones to sensors, therefore, analyzing and mining mobile data becomes an interesting p...
FIMI
2004
13 years 10 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
ICCAD
1991
IEEE
14 years 9 days ago
1991
IEEE
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
DEXA
2005
Springer
14 years 2 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
BIRTHDAY
2010
Springer
14 years 3 days ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...