1217 search results - page 142 / 244 » On compressing frequent patterns |
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper, we present an X-Fill (QC-Fill) method for not only slashing the test time but also reducing the test power (including both capture power and shifting power). QC-...
154
Voted
ICAPR
2009
Springer
15 years 8 months ago
2009
Springer
—A representation based on the phase of analytic image is proposed to address the issue of illumination variation in face recognition task. The problem of unwrapping in the compu...
148
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
135
click to vote
BIBE
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
144
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Discovering episodes, frequent sets of events from a sequence has been an active field in pattern mining. Traditionally, a level-wise approach is used to discover all frequent epis...