1217 search results - page 158 / 244 » On compressing frequent patterns |
116
Voted
USENIX
2003
15 years 5 months ago
2003
Both researchers and operators of production systems are frequently faced with the need to manipulate entire disk images. Convenient and fast tools for saving, transferring, and i...
157
click to vote
ALENEX
2009
15 years 5 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
132
click to vote
COGSCI
1998
15 years 3 months ago
1998
Conceptual integration—"blending"—is a general cognitive operation on a par with analogy, recursion, mental modeling, conceptual categorization, and framing. It serv...
141
Voted
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
140
click to vote
CIARP
2009
Springer
15 years 10 months ago
2009
Springer
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...