The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tamás Linder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  46. Bits in Asymptotically Optimal Lossy Source Codes Are Asymptotically Bernoulli. [Citation Graph (, )][DBLP]


  47. A multiple description video coding motivated by human visual perception. [Citation Graph (, )][DBLP]


  48. Inner and Outer Bounds for the Public Information Embedding Capacity Region Under Multiple Access Attacks [Citation Graph (, )][DBLP]


  49. High-resolution scalar quantization with Rényi entropy constraint [Citation Graph (, )][DBLP]


  50. Rate-Constrained Simulation and Source Coding IID Sources [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002