1217 search results - page 30 / 244 » On compressing frequent patterns |
121
Voted
SAC
2004
ACM
15 years 9 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
137
Voted
MCS
2010
Springer
15 years 2 months ago
2010
Springer
135
click to vote
CPM
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
153
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
129
click to vote
ET
2002
15 years 3 months ago
2002
In this paper a novel architecture for scan-based mixed mode BIST is presented. To reduce the storage requirements for the deterministic patterns it relies on a two-dimensional co...