1217 search results - page 67 / 244 » On compressing frequent patterns |
130
click to vote
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...
132
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
As the large size of test data volume is becoming one of the major problems in testing System-on-a-Chip (SoC), several compression coding schemes have been proposed. Extended frequ...
118
Voted
ICCD
2004
IEEE
16 years 20 days ago
2004
IEEE
This paper introduces a new method for deterministic diagnosis of logic cores. The proposed method is based on onchip decompression and comparison of incompletely specified test ...
119
Voted
TSP
2010
14 years 10 months ago
2010
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
142
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...