v

This paper presents a general technique to develop approximation algorithms for allocation problems with integral assignment constraints. The core of the method is a randomized dependent rounding scheme, called geometric rounding, which yields termwise rounding ratios (in expectation), while emphasizing the strong correlation between events. We further explore the intrinsic geometric structure ...

This paper proposes a three-dimensional (3D) integer wavelet transform with reduced amount of rounding noise. Non-separable multi-dimensional lifting structures are introduced to decrease the total number of lifting steps. Since the lifting step contains a rounding operation, variance of the rounding noise generated due to the rounding operation inside the transform is reduced. This paper also ...

Double rounding is a phenomenon that may occur when different floatingpoint precisions are available on the same system. Although double rounding is, in general, innocuous, it may change the behavior of some useful small floating-point algorithms. We analyze the potential influence of double rounding on the Fast2Sum and 2Sum algorithms, on some summation algorithms, and Veltkamp’s splitting.