1217 search results - page 65 / 244 » On compressing frequent patterns |
129
Voted
CPM
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
123
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
137
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Major media companies such as The Financial Times, the Wall Street Journal or Reuters generate huge amounts of textual news data on a daily basis. Mining frequent patterns in this...
133
click to vote
PAKDD
2004
ACM
15 years 9 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
139
Voted
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...