| 2008 |
|---|
| 50 | EE | András György,
Tamás Linder,
Gábor Lugosi:
Tracking the Best Quantizer.
IEEE Transactions on Information Theory 54(4): 1604-1625 (2008) |
| 49 | EE | Robert M. Gray,
Tamás Linder,
John T. Gill:
Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints.
IEEE Transactions on Information Theory 54(5): 2220-2242 (2008) |
| 2007 |
|---|
| 48 | EE | András György,
Tamás Linder,
Gábor Lugosi,
György Ottucsák:
The on-line shortest path problem under partial monitoring
CoRR abs/0704.1020: (2007) |
| 47 | EE | Firouz Behnamfar,
Fady Alajaji,
Tamás Linder:
An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes.
IEEE Transactions on Communications 55(6): 1093-1098 (2007) |
| 2006 |
|---|
| 46 | EE | András György,
Tamás Linder,
György Ottucsák:
The Shortest Path Problem Under Partial Monitoring.
COLT 2006: 468-482 |
| 45 | EE | Daniel A. Nagy,
A. Gyrgy,
Tamás Linder:
Symbol-Based Modeling and Coding of Block Markov Sources.
IEEE Transactions on Information Theory 52(12): 5570-5578 (2006) |
| 44 | EE | Tamás Linder,
Ram Zamir:
Causal coding of stationary sources and individual sequences with high resolution.
IEEE Transactions on Information Theory 52(2): 662-680 (2006) |
| 2005 |
|---|
| 43 | EE | András György,
Tamás Linder,
Gábor Lugosi:
Tracking the Best of Many Experts.
COLT 2005: 204-216 |
| 42 | EE | Yadong Wang,
Fady Alajaji,
Tamás Linder:
Design of VQ-Based Hybrid Digital-Analog Joint Source-Channel Codes for Image Communication.
DCC 2005: 193-202 |
| 41 | EE | Zahir Raza,
Fady Alajaji,
Tamás Linder:
Design of sample adaptive product quantizers for noisy channels.
IEEE Transactions on Communications 53(4): 576-580 (2005) |
| 40 | EE | Firouz Behnamfar,
Fady Alajaji,
Tamás Linder:
Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading.
IEEE Transactions on Communications 53(6): 952-956 (2005) |
| 39 | EE | Firouz Behnamfar,
Fady Alajaji,
Tamás Linder:
Image transmission over the polya channel via channel-optimized quantization.
IEEE Transactions on Signal Processing 53(2-1): 728-733 (2005) |
| 2004 |
|---|
| 38 | EE | Robert M. Gray,
Tamás Linder:
Results and Conjectures on High Rate Quantization.
Data Compression Conference 2004: 3-12 |
| 37 | EE | András György,
Tamás Linder,
Gábor Lugosi:
A "Follow the Perturbed Leader"-type Algorithm for Zero-Delay Quantization of Individual Sequence.
Data Compression Conference 2004: 342-351 |
| 2003 |
|---|
| 36 | EE | Robert M. Gray,
Tamás Linder:
High Rate Mismatch in Entropy Constrained Quantization.
DCC 2003: 173-182 |
| 35 | EE | Daniel A. Nagy,
Tamás Linder:
Experimental Study of a Binary Block Sorting Compression Scheme.
DCC 2003: 439 |
| 34 | | András György,
Tamás Linder,
Philip A. Chou,
Bradley J. Betts:
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
IEEE Transactions on Information Theory 49(11): 3031-3037 (2003) |
| 33 | | Robert M. Gray,
Tamás Linder:
Mismatch in high-rate entropy-constrained vector quantization.
IEEE Transactions on Information Theory 49(5): 1204-1217 (2003) |
| 32 | | András György,
Tamás Linder:
Codecell convexity in optimal entropy-constrained vector quantization.
IEEE Transactions on Information Theory 49(7): 1821-1828 (2003) |
| 2002 |
|---|
| 31 | EE | Firouz Behnamfar,
Fady Alajaji,
Tamás Linder:
Progressive Image Communication over Binary Channels with Additive Bursty Noise.
DCC 2002: 272-281 |
| 30 | | Tamás Linder:
Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates.
IEEE Transactions on Information Theory 48(11): 2998-3003 (2002) |
| 29 | | András György,
Tamás Linder:
On the structure of optimal entropy-constrained scalar quantizers.
IEEE Transactions on Information Theory 48(2): 416-427 (2002) |
| 28 | | Robert M. Gray,
Tamás Linder,
Jia Li:
A Lagrangian formulation of Zador's entropy-constrained quantization theorem.
IEEE Transactions on Information Theory 48(3): 695-707 (2002) |
| 27 | EE | András Antos,
Balázs Kégl,
Tamás Linder,
Gábor Lugosi:
Data-dependent margin-based generalization bounds for classification.
Journal of Machine Learning Research 3: 73-98 (2002) |
| 2001 |
|---|
| 26 | EE | Balázs Kégl,
Tamás Linder,
Gábor Lugosi:
Data-Dependent Margin-Based Generalization Bounds for Classification.
COLT/EuroCOLT 2001: 368-384 |
| 25 | | Tamás Linder,
Gábor Lugosi:
A zero-delay sequential scheme for lossy coding of individual sequences.
IEEE Transactions on Information Theory 47(6): 2533-2538 (2001) |
| 2000 |
|---|
| 24 | EE | Balázs Kégl,
Adam Krzyzak,
Tamás Linder,
Kenneth Zeger:
Learning and Design of Principal Curves.
IEEE Trans. Pattern Anal. Mach. Intell. 22(3): 281-297 (2000) |
| 23 | | Tamás Linder:
On the training distortion of vector quantizers.
IEEE Transactions on Information Theory 46(4): 1617-1623 (2000) |
| 22 | | Tamás Linder,
Ram Zamir,
Kenneth Zeger:
On source coding with side-information-dependent distortion measures.
IEEE Transactions on Information Theory 46(7): 2697-2704 (2000) |
| 21 | | András György,
Tamás Linder:
Optimal entropy-constrained scalar quantization of a uniform source.
IEEE Transactions on Information Theory 46(7): 2704-2711 (2000) |
| 1999 |
|---|
| 20 | | Tamás Linder,
Ram Zamir:
High-Resolution Source Coding for Non-Difference Distortion Measures: The Rate-Distortion Function.
IEEE Transactions on Information Theory 45(2): 533-547 (1999) |
| 19 | | Tamás Linder,
Ram Zamir,
Kenneth Zeger:
High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding.
IEEE Transactions on Information Theory 45(2): 548-561 (1999) |
| 18 | | András György,
Tamás Linder,
Kenneth Zeger:
On the rate-distortion function of random vectors and stationary sources with mixed distributions.
IEEE Transactions on Information Theory 45(6): 2110-2115 (1999) |
| 1998 |
|---|
| 17 | EE | Tamás Linder,
Ram Zamir,
Kenneth Zeger:
The Multiple Description Rate Region for High Resolution Source Coding.
Data Compression Conference 1998: 149-158 |
| 16 | EE | Balázs Kégl,
Adam Krzyzak,
Tamás Linder,
Kenneth Zeger:
A Polygonal Line Algorithm for Constructing Principal Curves.
NIPS 1998: 501-507 |
| 15 | | Peter L. Bartlett,
Tamás Linder,
Gábor Lugosi:
The Minimax Distortion Redundancy in Empirical Quantizer Design.
IEEE Transactions on Information Theory 44(5): 1802-1813 (1998) |
| 14 | EE | Adam Krzyzak,
Tamás Linder:
Radial basis function networks and complexity regularization in function learning.
IEEE Transactions on Neural Networks 9(2): 247-256 (1998) |
| 1997 |
|---|
| 13 | | Peter L. Bartlett,
Tamás Linder,
Gábor Lugosi:
A Minimax Lower Bound for Empirical Quantizer Design.
EuroCOLT 1997: 210-222 |
| 12 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Empirical quantizer design in the presence of source noise or channel noise.
IEEE Transactions on Information Theory 43(2): 612-623 (1997) |
| 11 | | Tamás Linder,
Vahid Tarokh,
Kenneth Zeger:
Existence of optimal prefix codes for infinite source alphabets.
IEEE Transactions on Information Theory 43(6): 2026-2028 (1997) |
| 1996 |
|---|
| 10 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Designing Vector Quantizers in the Presence of Source Noise or Channel Noise.
Data Compression Conference 1996: 33-42 |
| 9 | EE | Adam Krzyzak,
Tamás Linder:
Radial Basis Function Networks and Complexity Regularization in Function Learning.
NIPS 1996: 197-203 |
| 8 | | Tamás Linder,
Kenneth Zeger:
On the cost of finite block length in quantizing unbounded memoryless sources.
IEEE Transactions on Information Theory 42(2): 480-487 (1996) |
| 1995 |
|---|
| 7 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Fixed-rate universal lossy source coding and rates of convergence for memoryless sources.
IEEE Transactions on Information Theory 41(3): 665-676 (1995) |
| 1994 |
|---|
| 6 | | Tamás Linder,
Kenneth Zeger:
Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization.
IEEE Transactions on Information Theory 40(2): 575- (1994) |
| 5 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
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): 1728-1740 (1994) |
| 4 | | Tamás Linder,
Ram Zamir:
On the asymptotic tightness of the Shannon lower bound.
IEEE Transactions on Information Theory 40(6): 2026- (1994) |
| 1993 |
|---|
| 3 | | Tamás Linder,
Gábor Lugosi,
Kenneth Zeger:
Universality and Rates of Convergence in Lossy Source Coding.
Data Compression Conference 1993: 89-97 |
| 2 | EE | András Faragó,
Tamás Linder,
Gábor Lugosi:
Fast Nearest-Neighbor Search in Dissimilarity Spaces.
IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 957-962 (1993) |
| 1 | | Tamás Linder,
Christian Schlegel,
Kenneth Zeger:
Corrected proof of de Buda's theorem.
IEEE Transactions on Information Theory 39(5): 1735- (1993) |
