1217 search results - page 66 / 244 » On compressing frequent patterns |
145
click to vote
TVLSI
2010
14 years 10 months ago
2010
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
131
Voted
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
129
click to vote
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
125
click to vote
IMCSIT
2010
15 years 1 months ago
2010
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
134
click to vote
CPM
2001
Springer
15 years 8 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...