On hierarchical type covering
暂无分享,去创建一个
[1] Zhen Zhang,et al. The redundancy of source coding with a fidelity criterion: 1. Known statistics , 1997, IEEE Trans. Inf. Theory.
[3] Richard E. Blahut,et al. Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.
[4] Bixio Rimoldi,et al. Successive refinement of information: characterization of the achievable rates , 1994, IEEE Trans. Inf. Theory.
[5] Neri Merhav,et al. Hierarchical Guessing with a Fidelity Criterion , 1999, IEEE Trans. Inf. Theory.
[6] Edward Y. Chang,et al. Clustering for Approximate Similarity Search in High-Dimensional Spaces , 2002, IEEE Trans. Knowl. Data Eng..
[7] Neri Merhav,et al. Guessing Subject to Distortion , 1998, IEEE Trans. Inf. Theory.
[8] Divyakant Agrawal,et al. Approximate nearest neighbor searching in multimedia databases , 2001, Proceedings 17th International Conference on Data Engineering.
[9] Prakash Narayan,et al. Error exponents for successive refinement by partitioning , 1996, IEEE Trans. Inf. Theory.
[10] Kenneth Rose,et al. VQ-index: an index structure for similarity searching in multimedia databases , 2002, MULTIMEDIA '02.
[11] Bin Yu,et al. A rate of convergence result for a universal D-semifaithful code , 1993, IEEE Trans. Inf. Theory.
[12] R. Gray,et al. A new class of lower bounds to information rates of stationary sources via conditional rate-distortion functions , 1973, IEEE Trans. Inf. Theory.
[13] Kenneth Rose,et al. Natural type selection in adaptive lossy compression , 2001, IEEE Trans. Inf. Theory.
[14] Kenneth Rose,et al. Error exponents in scalable source coding , 2003, IEEE Trans. Inf. Theory.
[15] Katalin Marton,et al. Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.
[16] Toby Berger,et al. Rate distortion theory : a mathematical basis for data compression , 1971 .
[17] T. Berger. Rate-Distortion Theory , 2003 .