3715 search results - page 568 / 743 » A Space Optimization for FP-Growth |
CADE
2001
Springer
14 years 8 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...