Sciweavers

341 search results - page 52 / 69
» Redundancy elimination revisited
Sort
View
USENIX
2007
13 years 11 months ago
Supporting Practical Content-Addressable Caching with CZIP Compression
Content-based naming (CBN) enables content sharing across similar files by breaking files into positionindependent chunks and naming these chunks using hashes of their contents....
KyoungSoo Park, Sunghwan Ihm, Mic Bowman, Vivek S....
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 11 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
CF
2007
ACM
13 years 10 months ago
Computational and storage power optimizations for the O-GEHL branch predictor
In recent years, highly accurate branch predictors have been proposed primarily for high performance processors. Unfortunately such predictors are extremely energy consuming and i...
Kaveh Aasaraai, Amirali Baniasadi, Ehsan Atoofian
CLA
2004
13 years 10 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua
IADIS
2004
13 years 10 months ago
Simplifying the Clickstream Retrieval Using Weblogger Tool
Data Webhouses are used to retain all the information related to web user's behavior within a web site, working as a shared repository of business data. The advent of e-busin...
João Silva, João Bernardino