Sciweavers

1217 search results - page 36 / 244
» On compressing frequent patterns
Sort
View
138
Voted
DATE
2005
IEEE
171views Hardware» more  DATE 2005»
15 years 9 months ago
Access Pattern-Based Code Compression for Memory-Constrained Embedded Systems
As compared to a large spectrum of performance optimizations, relatively little effort has been dedicated to optimize other aspects of embedded applications such as memory space r...
Ozcan Ozturk, Hendra Saputra, Mahmut T. Kandemir, ...
114
Voted
CIDM
2007
IEEE
15 years 10 months ago
Structure Prediction in Temporal Networks using Frequent Subgraphs
— There are several types of processes which can be modeled explicitly by recording the interactions between a set of actors over time. In such applications, a common objective i...
Mayank Lahiri, Tanya Y. Berger-Wolf
121
Voted
DCC
2010
IEEE
15 years 7 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
ICIP
2004
IEEE
16 years 5 months ago
CVPIC image retrieval based on block colour co-occurance matrix and pattern histogram
Compressed domain image processing techniques are becoming increasingly important. Compressed domain retrieval It allows the calculation of image features and hence content-based ...
Gerald Schaefer, Simon Lieutaud, Guoping Qiu
DMIN
2006
138views Data Mining» more  DMIN 2006»
15 years 5 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou