References
- Capalbo, M., Reingold, O., Vadhan, S. and Wigderson, A. Randomness conductors and constant-degree lossless expanders, Proc. 34th Annual ACM Symp. on Theory of Computing, Montreal, Canada, May 2002, pp. 659–668.
- Batu, T., Dasgupta, S., Kumar, R. and Rubinfeld, R. The complexity of approximating entropy, Proc. 17th Annual IEEE Conf. on Computational Complexity, Montreal, Canada, May 2002, pp. 678–687.
- Pandurangan, G. and Upfal, E. Can entropy characterize performance of online algorithms? Proc. 20th Annual ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, January 2001, pp. 727–734.
- Shannon, C. E. A mathematical theory of communication. Bell Syst. Tech. J., 1948, (27), 379–423.
- Chan, Y. K. and Chang, C. C. An efficient data structure for storing similar binary images. In Information Organization and Databases: Foundation of Data Organization, (Eds K. Tanaka and S. Ghandeharizadeh), 2001, pp. 91–104 (Kluwer Academic, Massachusetts).
- Collet, C., Louys, M., Provost, J. N. and Oberto, A. Fusion of astronomical multiband images on a Markovian quadtree, Proc. 5th Int. Conf. on Information Fusion, Maryland, USA, July 2002, Vol. 1, pp. 396–403.
- Hanan, S. Data structures for quadtree approximation and compression. Commun. ACM, 1985, 28(9), 973–993.
- Shukla, R., Dragotti, P. L., Minh, D. and Vetterli, M. Improved quadtree algorithm based on joint coding for piecewise smooth image compression, Proc. IEEE Int. Conf. on Multimedia and Expo, Lausanne, Switzerland, 2002, Vol. 1, pp. 637–640.
- Voulgaris, G. and Jiang, J. Quadtree based image indexing in wavelets compressed domain, Proc. 20th Eurographics UK Conf., Leicester, UK, June 2002, pp. 89–93.
- Wise, D., Frens, J. D., Gu, Y. and Alexander, G. A. Language support for Morton-order matrices, Proc. 2001 ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP’01), Snowbird, UT, June 2001, pp. 18–20.