Sciweavers

1217 search results - page 73 / 244
» On compressing frequent patterns
Sort
View
WMPI
2004
ACM
15 years 9 months ago
An analytical model for software-only main memory compression
Abstract. Many applications with large data spaces that cannot run on a typical workstation (due to page faults) call for techniques to expand the effective memory size. One such t...
Irina Chihaia, Thomas R. Gross
ICIP
2008
IEEE
16 years 5 months ago
Kalman filtered Compressed Sensing
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...
Namrata Vaswani
ADC
2009
Springer
178views Database» more  ADC 2009»
15 years 10 months ago
CSC: Supporting Queries on Compressed Cached XML
Whenever a client frequently has to retrieve, to query and to locally transform large parts of a huge XML document that is stored on a remote web information server, data exchange...
Stefan Böttcher, Rita Hartel
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
16 years 5 months ago
Direct Discriminative Pattern Mining for Effective Classification
The application of frequent patterns in classification has demonstrated its power in recent studies. It often adopts a two-step approach: frequent pattern (or classification rule) ...
Hong Cheng, Xifeng Yan, Jiawei Han, Philip S. Yu
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 3 months ago
Temporal Support of Regular Expressions in Sequential Pattern Mining
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...