Unbiased matrix rounding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4059 LNCS, Issue , 2006, Pages 102-112

  Doerr, Benjamin ^a   Friedrich, Tobias ^a   Klein, Christian ^a   Osbild, Ralf ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; NUMERICAL METHODS; PROBLEM SOLVING; STATISTICAL MECHANICS;

ARBITRARY INTERVALS; ROUNDING ERRORS; STATISTICS APPLICATION;

MATRIX ALGEBRA;

EID: 33746472410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_12     Document Type: Conference Paper

References (25)

1. L T. Asano. Digital halftoning: Algorithm engineering challenges. IEICE Trans, on Inf. and Syst., E86-D: 159-178, 2003.
2. M. Bacharach. Matrix rounding problems. Management Science (Series A), 12:732-742, 1966.
3. Zs. Baranyai. On the factorization of the complete uniform hypergraph. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday), Vol. I, pages 91-108. Colloq. Math. Soc. János Bolyai, Vol. 10. North-Holland, Amsterdam, 1975.
4. J. Beck and J. Spencer. Well distributed 2-colorings of integers relative to long arithmetic progressions. Acta Arithm., 43:287-298, 1984.
5. J. L. Bentley. Algorithm design techniques. Commun. ACM, 27:865-871, 1984.
6. N. Brauner and Y. Crama. The maximum deviation just-in-time scheduling problem. Discrete Appl. Math., 134:25-50, 2004.
7. B. D. Causey, L. H. Cox, and L. R. Ernst. Applications of transportation theory to statistical problems. Journal of the American Statistical Association, 80:903-909, 1985.
8. L. H. Cox. A constructive procedure for unbiased controlled rounding. Journal of the American Statistical Association, 82:520-524, 1987.
9. L. H. Cox and L. R. Ernst. Controlled rounding. Informes, 20:423-432, 1982.
10. B. Doerr. Linear and hereditary discrepancy. Combinatorics, Probability and Computing, 9:349-354, 2000.
11. B. Doerr. Lattice approximation and linear discrepancy of totally unimodular matrices. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 119-125, 2001.
12. B. Doerr. Global roundings of sequences. Information Processing Letters, 92:113-116, 2004.
13. B. Doerr. Generating randomized roundings with cardinality constraints and derandomizations. In 23rd Annual Symposium on Theoretical Aspects of Computer Science, 2006.
14. B. Doerr, T. Friedrich, C. Klein, and R. Osbild. Hounding of sequences and matrices, with applications. In Third Workshop on Approximation and Online Algorithms, volume 3879 of Lecture Notes in Computer Science, pages 96-109. Springer, 2006.
15. I. P. Fellegi. Controlled random rounding. Survey Methodology, 1:123-133, 1975.
16. L.R. Ford, Jr., and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
17. D. E. Knuth. Two-way rounding. SIAM J. Discrete Math., 8:281-290, 1995.
18. Y. Monden. What makes the Toyota production system really tick? Industrial Eng., 13:36-46, 1981.
19. Y. Monden. Toyota Production System. Industrial Engineering and Management Press, Norcross, GA, 1983.
20. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci., 37:130-143, 1988.
21. K. Sadakane, N. Takki-Chebihi, and T. Tokuyama. Combinatorics and algorithms on low-discrepancy roundings of a real sequence. In ICALP 2001, volume 2076 of Lecture Notes in Computer Science, pages 166-177, Berlin Heidelberg, 2001. Springer-Verlag.
22. K. Sadakane, N. Takki-Chebihi, and T. Tokuyama. Discrepancy-based digital halftoning: Automatic evaluation and optimization. In Geometry, Morphology, and Computational Imaging, volume 2616 of Lecture Notes in Computer Science, pages 301-319, Berlin Heidelberg, 2003. Springer-Verlag.
23. J. Spencer. Ten lectures on the probabilistic method, volume 64 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994.
24. G. Steiner and S. Yeomans. Level schedules for mixed-model, just-in-time processes. Management Science, 39:728-735, 1993.
25. L. Willenborg and T. de Waal. Elements of Statistical Disclosure Control, volume 155 of Lecture Notes in Statistics. Springer, 2001.