1217 search results - page 40 / 244 » On compressing frequent patterns |
127
Voted
DLT
2004
15 years 5 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
130
Voted
COMPUTE
2010
ACM
15 years 8 months ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
129
Voted
ICCD
2003
IEEE
16 years 16 days ago
2003
IEEE
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
120
Voted
CAD
2010
Springer
15 years 3 months ago
2010
Springer
This paper addresses the problem of computing planar patterns for compression garments. In the garment industry, the compression garment has been more and more widely used to reta...
128
Voted
DCC
1998
IEEE
15 years 7 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...