Non-independent Randomized Rounding and an Application to Digital Halftoning
暂无分享,去创建一个
[1] Paul D. Seymour,et al. Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.
[2] W. M. Goodall. Television by pulse code modulation , 1951 .
[3] Benjamin Doerr. Non-independent randomized rounding , 2003, SODA '03.
[4] Aravind Srinivasan,et al. Improved Approximation Guarantees for Packing and Covering Integer Programs , 1999, SIAM J. Comput..
[5] Benjamin Doerr. Structured Randomized Rounding and Coloring , 2001, FCT.
[6] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[7] Anand Srivastav,et al. Derandomization in Combinatorial Optimization , 2001 .
[8] Lawrence G. Roberts,et al. Picture coding using pseudo-random noise , 1962, IRE Trans. Inf. Theory.
[9] Donald E. Knuth,et al. Digital halftones by dot diffusion , 1987, TOGS.
[10] B. Lippel,et al. The Effect of Dither on Luminance Quantization of Pictures , 1971 .
[11] Noga Alon,et al. On the discrepancy of combinatorial rectangles , 2002, Random Struct. Algorithms.
[12] Dimitris Bertsimas,et al. On dependent randomized rounding algorithms , 1999, Oper. Res. Lett..
[13] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[14] Tomomi Matsui,et al. Optimal Roundings of Sequences and Matrices , 2000, Nord. J. Comput..
[15] Jan P. Allebach,et al. Efficient model based halftoning using direct binary search , 1997, Proceedings of International Conference on Image Processing.
[16] Tomomi Matsui,et al. On the Complexities of the Optimal Rounding Problems of Sequences and Matrices , 2000, SWAT.
[17] Robert Ulichney,et al. Dithering with blue noise , 1988, Proc. IEEE.
[18] Benjamin Doerr,et al. Lattice approximation and linear discrepency of totally unimodular matrices , 2001, SODA '01.
[19] Rodney L. Miller,et al. Design of minimum visual modulation halftone patterns , 1991, IEEE Trans. Syst. Man Cybern..
[20] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[21] Robert Ulichney,et al. Digital Halftoning , 1987 .
[22] Donald E. Knuth. Two-Way Rounding , 1995, SIAM J. Discret. Math..
[23] Nimrod Megiddo,et al. Constructing Small Sample Spaces Satisfying Given Constraints , 1994, SIAM J. Discret. Math..
[24] David R. Karger,et al. (De)randomized Construction of Small Sample Spaces in NC , 1997, J. Comput. Syst. Sci..
[25] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[26] Tetsuo Asano,et al. Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning , 2002, SODA '02.