AAAAAA
Results:
1-20
|
Results: 20
Authors:
COSMAN P
ZEGER K
Citation: P. Cosman et K. Zeger, MEMORY CONSTRAINED WAVELET-BASED IMAGE-CODING, IEEE signal processing letters, 5(9), 1998, pp. 221-223
Authors:
MEHES A
ZEGER K
Citation: A. Mehes et K. Zeger, BINARY LATTICE VECTOR QUANTIZATION WITH LINEAR BLOCK-CODES AND AFFINEINDEX ASSIGNMENTS, IEEE transactions on information theory, 44(1), 1998, pp. 79-94
Authors:
SHERWOOD PG
ZEGER K
Citation: Pg. Sherwood et K. Zeger, PROGRESSIVE IMAGE-CODING FOR NOISY CHANNELS, IEEE signal processing letters, 4(7), 1997, pp. 189-191
Authors:
HAMKINS J
ZEGER K
Citation: J. Hamkins et K. Zeger, ASYMPTOTICALLY DENSE SPHERICAL CODES .1. WRAPPED SPHERICAL CODES, IEEE transactions on information theory, 43(6), 1997, pp. 1774-1785
Authors:
HAMKINS J
ZEGER K
Citation: J. Hamkins et K. Zeger, ASYMPTOTICALLY DENSE SPHERICAL CODES .2. LAMINATED SPHERICAL CODES, IEEE transactions on information theory, 43(6), 1997, pp. 1786-1798
Authors:
LINDER T
TAROKH V
ZEGER K
Citation: T. Linder et al., EXISTENCE OF OPTIMAL PREFIX CODES FOR INFINITE SOURCE ALPHABETS, IEEE transactions on information theory, 43(6), 1997, pp. 2026-2028
Authors:
HOCHWALD B
ZEGER K
Citation: B. Hochwald et K. Zeger, TRADEOFF BETWEEN SOURCE AND CHANNEL CODING, IEEE transactions on information theory, 43(5), 1997, pp. 1412-1424
Authors:
HAMKINS J
ZEGER K
Citation: J. Hamkins et K. Zeger, IMPROVED BOUNDS ON MAXIMUM SIZE BINARY RADAR ARRAYS, IEEE transactions on information theory, 43(3), 1997, pp. 997-1000
Authors:
LINDER T
LUGOSI G
ZEGER K
Citation: T. Linder et al., EMPIRICAL QUANTIZER DESIGN IN THE PRESENCE OF SOURCE NOISE OR CHANNELNOISE, IEEE transactions on information theory, 43(2), 1997, pp. 612-623
Authors:
LINDER T
ZEGER K
Citation: T. Linder et K. Zeger, ON THE COST OF FINITE BLOCK LENGTH IN QUANTIZING UNBOUNDED MEMORYLESSSOURCES, IEEE transactions on information theory, 42(2), 1996, pp. 480-487
Authors:
LUGOSI G
ZEGER K
Citation: G. Lugosi et K. Zeger, CONCEPT-LEARNING USING COMPLEXITY REGULARIZATION, IEEE transactions on information theory, 42(1), 1996, pp. 48-54
Authors:
LINDER T
LUGOSI G
ZEGER K
Citation: T. Linder et al., FIXED-RATE UNIVERSAL LOSSY SOURCE-CODING AND RATES OF CONVERGENCE FORMEMORYLESS SOURCES, IEEE transactions on information theory, 41(3), 1995, pp. 665-676
Authors:
LUGOSI G
ZEGER K
Citation: G. Lugosi et K. Zeger, NONPARAMETRIC-ESTIMATION VIA EMPIRICAL RISK MINIMIZATION, IEEE transactions on information theory, 41(3), 1995, pp. 677-687
Authors:
ZEGER K
BIST A
LINDER T
Citation: K. Zeger et al., UNIVERSAL SOURCE-CODING WITH CODEBOOK TRANSMISSION, IEEE transactions on communications, 42(2-4), 1994, pp. 336-346
Authors:
LINDER T
LUGOSI G
ZEGER K
Citation: T. Linder et al., RATES OF CONVERGENCE IN THE SOURCE-CODING THEOREM, IN EMPIRICAL QUANTIZER DESIGN, AND IN UNIVERSAL LOSSY SOURCE-CODING, IEEE transactions on information theory, 40(6), 1994, pp. 1728-1740
Authors:
ZEGER K
MANZELLA V
Citation: K. Zeger et V. Manzella, ASYMPTOTIC BOUNDS ON OPTIMAL NOISY CHANNEL QUANTIZATION VIA RANDOM CODING, IEEE transactions on information theory, 40(6), 1994, pp. 1926-1938
Authors:
ZEGER K
GERSHO A
Citation: K. Zeger et A. Gersho, NUMBER OF NEAREST NEIGHBORS IN A EUCLIDEAN CODE, IEEE transactions on information theory, 40(5), 1994, pp. 1647-1649
Authors:
LINDER T
ZEGER K
Citation: T. Linder et K. Zeger, ASYMPTOTIC ENTROPY-CONSTRAINED PERFORMANCE OF TESSELLATING AND UNIVERSAL RANDOMIZED LATTICE QUANTIZATION, IEEE transactions on information theory, 40(2), 1994, pp. 575-579
Authors:
LINDER T
SCHLEGEL C
ZEGER K
Citation: T. Linder et al., CORRECTED PROOF OF DE BUDAS THEOREM, IEEE transactions on information theory, 39(5), 1993, pp. 1735-1737
Authors:
ZEGER K
KANTOROVITZ MR
Citation: K. Zeger et Mr. Kantorovitz, AVERAGE NUMBER OF FACETS PER CELL IN TREE-STRUCTURED VECTOR QUANTIZERPARTITIONS, IEEE transactions on information theory, 39(3), 1993, pp. 1053-1055
Risultati:
1-20
|