45 search results - page 6 / 9 » Compressed Counting |
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
ADC
2003
Springer
14 years 3 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
COCO
2004
Springer
14 years 3 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
PPOPP
2003
ACM
14 years 3 months ago
2003
ACM
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
IMC
2005
ACM
14 years 3 months ago
2005
ACM
Network engineers and operators are faced with a number of challenges that arise in the context of network monitoring and measurement. These include: i) how much information is in...