Unbiased Rounding of Rational Matrices

Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph coloring, in scheduling and in statistics. Here, it often is also desirable to round each entry randomly such that the probability of rounding it up equals its fractional part. This is known as unbiased rounding in statistics and as randomized rounding in computer science. We show how to compute such an unbiased rounding of an m

• Type: Conference
• Year: 2006
• Where: FSTTCS
• Authors: Benjamin Doerr, Christian Klein
• Keywords: FSTTCS 2006, Rounding, Rounding Errors, Software Engineering, Unbiased Rounding