Sciweavers

269 search results - page 2 / 54
» Computing the inverse sort transform in linear time
Sort
View
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
13 years 11 months ago
On Adaptive Integer Sorting
This paper considers integer sorting on a RAM. We show that adaptive sorting of a sequence with qn inversions is asymptotically equivalent to multisorting groups of at most q keys...
Anna Pagh, Rasmus Pagh, Mikkel Thorup
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 7 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
RECOMB
2009
Springer
14 years 6 months ago
Sorting Signed Permutations by Inversions in O(nlogn) Time
Krister M. Swenson, Vaibhav Rajan, Yu Lin, Bernard...
VLDB
2007
ACM
117views Database» more  VLDB 2007»
14 years 6 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
13 years 11 months ago
A Compression-Boosting Transform for Two-Dimensional Data
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman