-
1
-
-
0023247786
-
Geometric applications of a matrix-searching algorithm
-
A. Aggarval, M. Klave, S. Moran, P. Shor, R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica 2 (1987) 195-208.
-
(1987)
Algorithmica
, vol.2
, pp. 195-208
-
-
Aggarval, A.1
Klave, M.2
Moran, S.3
Shor, P.4
Wilber, R.5
-
2
-
-
0024132074
-
Notes on searching in multidimensional monotone arrays
-
A. Aggarwal, J. Park, Notes on searching in multidimensional monotone arrays, in: Proc. of FOCS '88, White Plains, New York, 24-26 October, 1988, pp. 497-512.
-
Proc. of FOCS '88, White Plains, New York, 24-26 October, 1988
, pp. 497-512
-
-
Aggarwal, A.1
Park, J.2
-
3
-
-
51249165028
-
Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
-
A. Aggarwal, B. Schieber, T. Tokuyama, Finding a minimum-weight k-link path in graphs with the concave Monge property and applications, Discrete Comput. Geom. 12 (1994) 263-280.
-
(1994)
Discrete Comput. Geom.
, vol.12
, pp. 263-280
-
-
Aggarwal, A.1
Schieber, B.2
Tokuyama, T.3
-
4
-
-
0003669971
-
-
A. Apostolico, Z. Galil (Eds.); Oxford Univ. Press, New York
-
A. Apostolico, Z. Galil (Eds.), Pattern Matching Algorithms, Oxford Univ. Press, New York, 1997.
-
(1997)
Pattern Matching Algorithms
-
-
-
5
-
-
0346198311
-
Optimum quantization
-
ScD thesis, MIT, May 14
-
J.D. Bruce, Optimum quantization, ScD thesis, MIT, May 14, 1964.
-
(1964)
-
-
Bruce, J.D.1
-
9
-
-
0033184670
-
Distortion-rate bounds for fixed- and variable-rate multiresolution source codes
-
M. Effros, Distortion-rate bounds for fixed- and variable-rate multiresolution source codes, IEEE Trans. Inform. Theory 45 (1999) 1887-1910.
-
(1999)
IEEE Trans. Inform. Theory
, vol.45
, pp. 1887-1910
-
-
Effros, M.1
-
10
-
-
0038426022
-
Codecell contiguity in optimal fixed-rate and entropy-constrained network scalar quantizers
-
M. Effros, D. Muresan, Codecell contiguity in optimal fixed-rate and entropy-constrained network scalar quantizers, in: Proc. IEEE Data Compression Conference, April 2002, pp. 312-321.
-
Proc. IEEE Data Compression Conference, April 2002
, pp. 312-321
-
-
Effros, M.1
Muresan, D.2
-
12
-
-
0020100099
-
The complexity of the generalized Lloyd-Max problem
-
M.R. Garey, D.S. Johnson, H.S. Witsenhausen, The complexity of the generalized Lloyd-Max problem, IEEE Trans. Inform. Theory 28 (2) (1982) 255-256.
-
(1982)
IEEE Trans. Inform. Theory
, vol.28
, Issue.2
, pp. 255-256
-
-
Garey, M.R.1
Johnson, D.S.2
Witsenhausen, H.S.3
-
13
-
-
0032311780
-
A linear algorithm for optimal context clustering with application to bi-level image coding
-
D. Greene, F. Yao, T. Zhang, A linear algorithm for optimal context clustering with application to bi-level image coding, in: IEEE ICIP '98, 1998, pp. 508-511.
-
IEEE ICIP '98, 1998
, pp. 508-511
-
-
Greene, D.1
Yao, F.2
Zhang, T.3
-
14
-
-
0036477215
-
On the structure of optimal entropy-constrained scalar quantizers
-
A. Gyorgy, T. Linder, On the structure of optimal entropy-constrained scalar quantizers, IEEE Trans. Inform. Theory 48 (2002) 416-427.
-
(2002)
IEEE Trans. Inform. Theory
, vol.48
, pp. 416-427
-
-
Gyorgy, A.1
Linder, T.2
-
15
-
-
0030675160
-
Entropy-constrained successively refinable scalar quantization
-
H. Jafarkhani, H. Brunk, N. Farvardin, Entropy-constrained successively refinable scalar quantization, in: Proc. IEEE Data Compression Conference, March 1997, pp. 337-346.
-
Proc. IEEE Data Compression Conference, March 1997
, pp. 337-346
-
-
Jafarkhani, H.1
Brunk, H.2
Farvardin, N.3
-
16
-
-
84937350296
-
Quantizing for minimum distortion
-
J. Max, Quantizing for minimum distortion, IRE Trans. Inform. Theory IT-6 (1960) 7-12.
-
(1960)
IRE Trans. Inform. Theory
, vol.IT-6
, pp. 7-12
-
-
Max, J.1
-
17
-
-
2642516351
-
Quantization as histogram segmentation: Globally optimal scalar quantizer design in network systems
-
D. Muresan, M. Effros, Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems, in: Proc. IEEE Data Compression Conference, April 2002, pp. 302-311.
-
Proc. IEEE Data Compression Conference, April 2002
, pp. 302-311
-
-
Muresan, D.1
Effros, M.2
-
18
-
-
0037784118
-
Computing a minimum-weight k-link path in graphs with the concave Monge property
-
B. Schieber, Computing a minimum-weight k-link path in graphs with the concave Monge property, in: Proc. ACM-SIAM Symp. on Algorithms '95, 1995, pp. 405-411.
-
Proc. ACM-SIAM Symp. on Algorithms '95, 1995
, pp. 405-411
-
-
Schieber, B.1
-
19
-
-
0018032354
-
Design of absolutely optimal quantizers for a wide class of distortion measures
-
D.K. Sharma, Design of absolutely optimal quantizers for a wide class of distortion measures, IEEE Trans. Inform. Theory IT-24 (1978) 693-702.
-
(1978)
IEEE Trans. Inform. Theory
, vol.IT-24
, pp. 693-702
-
-
Sharma, D.K.1
-
20
-
-
38149145478
-
Optimal quantization by matrix searching
-
X. Wu, Optimal quantization by matrix searching, J. Algorithms 12 (1991) 663-673.
-
(1991)
J. Algorithms
, vol.12
, pp. 663-673
-
-
Wu, X.1
-
21
-
-
0027597078
-
Quantizer monotonicities and globally optimal scalar quantizer design
-
X. Wu, K. Zhang, Quantizer monotonicities and globally optimal scalar quantizer design, IEEE Trans. Inform. Theory 39 (1993) 1049-1053.
-
(1993)
IEEE Trans. Inform. Theory
, vol.39
, pp. 1049-1053
-
-
Wu, X.1
Zhang, K.2
|