Sciweavers

1217 search results - page 96 / 244
» On compressing frequent patterns
Sort
View
VTS
2003
IEEE
119views Hardware» more  VTS 2003»
15 years 9 months ago
Test Data Compression Using Dictionaries with Fixed-Length Indices
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
Lei Li, Krishnendu Chakrabarty
CHI
1999
ACM
15 years 8 months ago
Time-Compression: Systems Concerns, Usage, and Benefits
With the proliferation of online multimedia content and the popularity of multimedia streaming systems, it is increasingly useful to be able to skim and browse multimedia quickly....
Nosa Omoigui, Liwei He, Anoop Gupta, Jonathan Grud...
IR
2008
15 years 4 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
FIMI
2004
172views Data Mining» more  FIMI 2004»
15 years 5 months ago
AIM2: Improved implementation of AIM
We present AIM2-F, an improved implementation of AIM-F [4] algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the e...
Sagi Shporer
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
15 years 10 months ago
Zonal Co-location Pattern Discovery with Dynamic Parameters
Zonal co-location patterns represent subsets of featuretypes that are frequently located in a subset of space (i.e., zone). Discovering zonal spatial co-location patterns is an im...
Mete Celik, James M. Kang, Shashi Shekhar