Sciweavers

1217 search results - page 97 / 244
» On compressing frequent patterns
Sort
View
PKDD
2004
Springer
79views Data Mining» more  PKDD 2004»
15 years 9 months ago
A Framework for Data Mining Pattern Management
Abstract. To represent and manage data mining patterns, several aspects have to be taken into account: (i) patterns are heterogeneous in nature; (ii) patterns can be extracted from...
Barbara Catania, Anna Maddalena, Maurizio Mazza, E...
ICIP
2000
IEEE
16 years 5 months ago
Integrated Compression and Linear Feature Detection in the Wavelet Domain
In many Earth observation missions, a large amount of data is collected by the on-board sensors, and must be transmitted to ground through a channel with limited capacity; in this...
Enrico Magli, Gabriella Olmo
121
Voted
MFCS
2009
Springer
15 years 10 months ago
Self-indexed Text Compression Using Straight-Line Programs
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
Francisco Claude, Gonzalo Navarro
ICDAR
2003
IEEE
15 years 9 months ago
Word Searching in CCITT Group 4 Compressed Document Images
In this paper, we present a compressed pattern matching method for searching user queried words in the CCITT Group 4 compressed document images, without decompressing. The feature...
Yue Lu, Chew Lim Tan
CPM
2000
Springer
145views Combinatorics» more  CPM 2000»
15 years 8 months ago
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
Gonzalo Navarro, Jorma Tarhio