123 search results - page 1 / 25 » Counting inversions in lists |
SODA
2003
ACM
13 years 5 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 1 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 ...
TIP
2011
12 years 11 months ago
2011
—The removal of Poisson noise is often performed through the following three-step procedure. First, the noise variance is stabilized by applying the Anscombe root transformation ...
STOC
2002
ACM
14 years 4 months ago
2002
ACM
COCOON
2008
Springer
13 years 6 months ago
2008
Springer