34 search results - page 1 / 7 » Approximate counting of inversions in a data stream |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
SODA
2003
ACM
13 years 6 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
VLDB
2002
ACM
13 years 5 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...