Sciweavers

45 search results - page 1 / 9
» Compressed Counting
Sort
View
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 4 months ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
Ping Li
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
DCC
2004
IEEE
14 years 4 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
DATE
2002
IEEE
103views Hardware» more  DATE 2002»
13 years 9 months ago
Test Resource Partitioning and Reduced Pin-Count Testing Based on Test Data Compression
We present a new test resource partitioning (TRP) technique for reduced pin-count testing of system-on-a-chip (SOC). The proposed technique is based on test data compression and o...
Anshuman Chandra, Krishnendu Chakrabarty
CORR
2008
Springer
69views Education» more  CORR 2008»
13 years 4 months ago
Compressed Counting
Ping Li