13 search results - page 1 / 3 » Entropy and Sorting |
ACSC
2002
IEEE
13 years 10 months ago
2002
IEEE
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to pa...
STOC
1992
ACM
13 years 9 months ago
1992
ACM
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
Information processing operations in support of intelligence analysis are of two kinds. They may sift relevant data from a larger body, thus reducing its quantity, or sort that dat...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compressio...