Tamás Linder

IEEE Trans. Inf. Theory, November, 2024

2023

An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise.

[BibT_eX]

[DOI]

Jonathan Keeler

IEEE Trans. Inf. Theory, October, 2023

Lossless Transformations and Excess Risk Bounds in Statistical Inference.

[BibT_eX]

[DOI]

László Györfi

Harro Walk

Entropy, October, 2023

Capacity of Finite-State Two-Way Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes.

[BibT_eX]

[DOI]

Meysam Ghomi

IEEE Trans. Inf. Theory, 2022

Logarithmic regret in online linear quadratic control using Riccati updates.

[BibT_eX]

[DOI]

Math. Control. Signals Syst., 2022

Rényi Cross-Entropy Measures for Common Distributions and Processes with Memory.

[BibT_eX]

[DOI]

Ferenc Cole Thierrin

Entropy, 2022

An Asymptotically Optimal Two-Part Coding Scheme for Networked Control under Fixed-Rate Constraints.

[BibT_eX]

[DOI]

Jonathan Keeler

Proceedings of the IEEE International Symposium on Information Theory, 2022

On the Rényi Cross-Entropy.

[BibT_eX]

[DOI]

Ferenc Cole Thierrin

Proceedings of the 17th Canadian Workshop on Information Theory, 2022

Achieving Logarithmic Regret via Hints in Online Learning of Noisy LQR Systems.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021

Two-Way Source-Channel Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On the lack of monotonicity of Newton-Hewer updates for Riccati equations.

[BibT_eX]

[DOI]

Autom., 2021

An Information Bottleneck Problem with Rényi's Entropy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Asymptotic Optimality of Finite Model Approximations for Partially Observed Markov Decision Processes With Discounted Cost.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2020

Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2020

Signaling Games for Arbitrary Distributions: Number of Bins and Properties of Equilibria.

[BibT_eX]

[DOI]

CoRR, 2020

A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results.

[BibT_eX]

[DOI]

Jian-Jian Weng

CoRR, 2020

Riccati updates for online linear quadratic control.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual Conference on Learning for Dynamics and Control, 2020

A Simple Capacity Outer Bound for Two-Way Channels and Capacity Approximation Results.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Adaptive Coding for Two-Way Lossy Source-Channel Communication.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Optimality of Stationary and Deterministic Policies for Zero-Delay Coding of ℝ<sup>d</sup>-Valued Linear Markov Sources with Quadratic Cost.

[BibT_eX]

[DOI]

Meysam Ghomi

Proceedings of the 59th IEEE Conference on Decision and Control, 2020

2019

Capacity of Two-Way Channels With Symmetry Properties.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost.

[BibT_eX]

[DOI]

Lin Song

IEEE Trans. Inf. Theory, 2019

Estimation Efficiency Under Privacy Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2019

On the Number of Bins in Equilibria for Signaling Games.

[BibT_eX]

[DOI]

CoRR, 2019

Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way Channels.

[BibT_eX]

[DOI]

Jian-Jian Weng

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Number of Bins in Equilibria for Signaling Games.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Capacity of Generalized Discrete-Memoryless Push-to-Talk Two-Way Channels.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Workshop on Information Theory, 2019

2018

On the Noise-Information Separation of a Private Principal Component Analysis Scheme.

[BibT_eX]

[DOI]

Serban Teodor Belinschi

James A. Mingo

CoRR, 2018

Optimized Signaling of Binary Correlated Sources Over Gaussian Multiple Access Channels.

[BibT_eX]

[DOI]

Proceedings of the 88th IEEE Vehicular Technology Conference, 2018

Sufficient Conditions for the Tightness of Shannon's Capacity Bounds for Two-Way Channels.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Convergence Rate of Push-Sum Algorithms on Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017

Optimal Joint Decoding of Correlated Data Over Orthogonal Multiple-Access Channels With Memory.

[BibT_eX]

[DOI]

Seyed Parsa Beheshti

IEEE Trans. Veh. Technol., 2017

Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes.

[BibT_eX]

[DOI]

Richard G. Wood

IEEE Trans. Inf. Theory, 2017

Distributed Online Convex Optimization on Time-Varying Directed Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Control. Netw. Syst., 2017

Finite Model Approximations and Asymptotic Optimality of Quantized Policies in Decentralized Stochastic Control.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2017

On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

Finite Model Approximations for Partially Observed Markov Decision Processes with Discounted Cost.

[BibT_eX]

[DOI]

CoRR, 2017

Optimized Signaling of Binary Correlated Sources over GMACs.

[BibT_eX]

[DOI]

CoRR, 2017

Lossy transmission of correlated sources over two-way channels.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

On the capacity of burst noise-erasure channels with and without feedback.

[BibT_eX]

[DOI]

Lin Song

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Privacy-aware guessing efficiency.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

On Rates of Convergence for Markov Chains Under Random Time State Dependent Drift Criteria.

[BibT_eX]

[DOI]

Ramiro Zurkowski

IEEE Trans. Autom. Control., 2016

Information Extraction Under Privacy Constraints.

[BibT_eX]

[DOI]

Inf., 2016

Adaptation is useless for two discrete additive-noise two-way channels.

[BibT_eX]

[DOI]

Lin Song

Proceedings of the IEEE International Symposium on Information Theory, 2016

Privacy-aware MMSE estimation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Almost Perfect Privacy for Additive Gaussian Privacy Filters.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 9th International Conference, 2016

Asymptotic optimality of finite representations and quantized policies in team problems and Witsenhausen's counterexample.

[BibT_eX]

[DOI]

Proceedings of the 2016 American Control Conference, 2016

2015

Binary Signaling of Correlated Sources Over Orthogonal Multiple-Access Channels.

[BibT_eX]

[DOI]

Tyson P. Mitchell

IEEE Wirel. Commun. Lett., 2015

Output Constrained Lossy Source Coding With Limited Common Randomness.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Randomized Quantization and Source Coding With Constrained Output Distribution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Asymptotic Optimality and Rates of Convergence of Quantized Stationary Policies in Stochastic Control.

[BibT_eX]

[DOI]

IEEE Trans. Autom. Control., 2015

Asymptotic Optimality of Finite Approximations to Markov Decision Processes with General State and Action Spaces.

[BibT_eX]

[DOI]

CoRR, 2015

Optimality of Walrand-Varaiya type policies and approximation results for zero delay coding of Markov sources.

[BibT_eX]

[DOI]

Richard G. Wood

Proceedings of the IEEE International Symposium on Information Theory, 2015

On maximal correlation, mutual information and data privacy.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

Finite-state approximation of Markov decision processes with unbounded costs and Borel spaces.

[BibT_eX]

[DOI]

Proceedings of the 54th IEEE Conference on Decision and Control, 2015

Finite state approximations of Markov decision processes with general state and action spaces.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2015

Finite-state approximations to constrained Markov decision processes with Borel spaces.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Lossless secure source coding: Yamamoto's setting.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

On Optimal Zero-Delay Coding of Vector Markov Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

MAP Decoding of Correlated Sources over Soft-Decision Orthogonal Multiple Access Fading Channels with Memory.

[BibT_eX]

[DOI]

Seyed Parsa Beheshti

Proceedings of the IEEE 80th Vehicular Technology Conference, 2014

Asymptotic optimality of quantized policies in stochastic control under weak continuity conditions.

[BibT_eX]

[DOI]

Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

Randomized source coding with limited common randomness.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Notes on information-theoretic privacy.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Distributed subgradient-push online convex optimization on time-varying directed graphs.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

MAP Detection and Robust Lossy Coding Over Soft-Decision Correlated Fading Channels.

[BibT_eX]

[DOI]

Shervin Shahidi

Youness Aliyari Ghassabeh

IEEE Trans. Veh. Technol., 2013

On some convergence properties of the subspace constrained mean shift.

[BibT_eX]

[DOI]

Glen Takahara

Pattern Recognit., 2013

Rényi divergence measures for commonly used univariate continuous distributions.

[BibT_eX]

[DOI]

Manuel Gil

Inf. Sci., 2013

Quantized Stationary Control Policies in Markov Decision Processes.

[BibT_eX]

[DOI]

CoRR, 2013

Randomized quantization and optimal design with a marginal constraint.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

An achievability proof for the lossy coding of Markov sources with feed-forward.

[BibT_eX]

[DOI]

Proceedings of the 13th Canadian Workshop on Information Theory, 2013

Approximation of stationary control policies by quantized control in Markov decision processes.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Entropy Density and Mismatch in High-Rate Scalar Quantization With Rényi Entropy Constraint.

[BibT_eX]

[DOI]

Wolfgang Kreitmeier

IEEE Trans. Inf. Theory, 2012

Efficient Tracking of Large Classes of Experts.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Optimization and Convergence of Observation Channels in Stochastic Control.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2012

MAP decoding of quantized sources over soft-decision fading channels with memory.

[BibT_eX]

[DOI]

Shervin Shahidi

Proceedings of IEEE International Conference on Communications, 2012

On optimal zero-delay quantization of vector Markov sources.

[BibT_eX]

[DOI]

Youness Aliyari Ghassabeh

Proceedings of the 51th IEEE Conference on Decision and Control, 2012

On the convergence and applications of mean shift type algorithms.

[BibT_eX]

[DOI]

Glen Takahara

Proceedings of the 25th IEEE Canadian Conference on Electrical and Computer Engineering, 2012

2011

Rate-Constrained Simulation and Source Coding i.i.d. Sources.

[BibT_eX]

[DOI]

Mark Z. Mao

IEEE Trans. Inf. Theory, 2011

High-Resolution Scalar Quantization With Rényi Entropy Constraint.

[BibT_eX]

[DOI]

Wolfgang Kreitmeier

IEEE Trans. Inf. Theory, 2011

On the Performance of Hybrid Digital-Analog Coding for Broadcasting Correlated Gaussian Sources.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2011

Scalar quantization with Rényi entropy constraint.

[BibT_eX]

[DOI]

Wolfgang Kreitmeier

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On Asymptotically Optimal Stationary Source Codes for IID Sources.

[BibT_eX]

[DOI]

Mark Z. Mao

Proceedings of the 2011 Data Compression Conference (DCC 2011), 2011

2010

On the optimal performance in asymmetric gaussian wireless sensor networks with fading.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2010

Rate-Constrained Simulation and Source Coding IID Sources

[BibT_eX]

[DOI]

Mark Z. Mao

CoRR, 2010

Inner and Outer Bounds for the Public Information Embedding Capacity Region Under Multiple Access Attacks

[BibT_eX]

[DOI]

CoRR, 2010

On optimization and convergence of observation channels and quantizers in stochastic control.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

Random-coding lower bounds for the error exponent of joint quantization and watermarking systems.

[BibT_eX]

[DOI]

Yangfan Zhong

IEEE Trans. Inf. Theory, 2009

Hybrid digital-analog coding with bandwidth compression for gaussian source-channel pairs.

[BibT_eX]

[DOI]

Yadong Wang

IEEE Trans. Commun., 2009

MAP decoding for multi-antenna systems with non-uniform sources: exact pairwise error probability and applications.

[BibT_eX]

[DOI]

Hamidreza Ebrahimzadeh Saffar

IEEE Trans. Commun., 2009

COVQ for MAP hard-decision demodulated channels.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2009

Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Bits in Asymptotically Optimal Lossy Source Codes Are Asymptotically Bernoulli.

[BibT_eX]

[DOI]

Proceedings of the 2009 Data Compression Conference (DCC 2009), 2009

2008

Tracking the Best Quantizer.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints.

[BibT_eX]

[DOI]

John T. Gill III

IEEE Trans. Inf. Theory, 2008

On the public information embedding capacity region under multiple access attacks.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

On the optimal power-distortion region for asymmetric Gaussian sensor networks with fading.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A multiple description video coding motivated by human visual perception.

[BibT_eX]

[DOI]

Saeed Moradi

Saeed Gazor

Proceedings of the IEEE International Conference on Acoustics, 2008

2007

An Efficient Algorithmic Lower Bound for the Error Rate of Linear Block Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2007

The On-Line Shortest Path Problem Under Partial Monitoring.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2007

A Sufficient Condition for Private Information Hiding of Two Correlated Sources Under Multiple Access Attacks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Channel-Optimized Quantization With Soft-Decision Demodulation for Space-Time Orthogonal Block-Coded Channels.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2006

Symbol-Based Modeling and Coding of Block Markov Sources.

[BibT_eX]

[DOI]

Daniel A. Nagy

A. Gyrgy

IEEE Trans. Inf. Theory, 2006

Causal coding of stationary sources and individual sequences with high resolution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

The Shortest Path Problem in the Bandit Setting.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

The Shortest Path Problem Under Partial Monitoring.

[BibT_eX]

[DOI]

György Ottucsák

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

Image transmission over the polya channel via channel-optimized quantization.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2005

Design of sample adaptive product quantizers for noisy channels.

[BibT_eX]

[DOI]

Zahir Raza

IEEE Trans. Commun., 2005

Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2005

Design of VQ-Based Hybrid Digital-Analog Joint Source-Channel Codes for Image Communication.

[BibT_eX]

[DOI]

Yadong Wang

Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

Tracking the Best of Many Experts.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Limited-Delay Coding of Individual Sequences with Piecewise Different Behavior.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2004

Causal coding of individual sequences and the Lempel-Ziv differential entropy.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Efficient algorithms and minimax bounds for zero-delay lossy source coding.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A "Follow the Perturbed Leader"-type Algorithm for Zero-Delay Quantization of Individual Sequence.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

Results and Conjectures on High Rate Quantization.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Codecell convexity in optimal entropy-constrained vector quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Mismatch in high-rate entropy-constrained vector quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Performance analysis of MAP decoded space-time orthogonal block codes for non-uniform sources.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Experimental Study of a Binary Block Sorting Compression Scheme.

[BibT_eX]

[DOI]

Daniel A. Nagy

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

High Rate Mismatch in Entropy Constrained Quantization.

[BibT_eX]

[DOI]

Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003

2002

Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

On the structure of optimal entropy-constrained scalar quantizers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

A Lagrangian formulation of Zador's entropy-constrained quantization theorem.

[BibT_eX]

[DOI]

Jia Li

IEEE Trans. Inf. Theory, 2002

Data-dependent margin-based generalization bounds for classification.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2002

Progressive Image Communication over Binary Channels with Additive Bursty Noise.

[BibT_eX]

[DOI]

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001

A zero-delay sequential scheme for lossy coding of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Data-Dependent Margin-Based Generalization Bounds for Classification.

[BibT_eX]

[DOI]

Balázs Kégl

Proceedings of the Computational Learning Theory, 2001

2000

On source coding with side-information-dependent distortion measures.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

On the training distortion of vector quantizers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Optimal entropy-constrained scalar quantization of a uniform source.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Learning and Design of Principal Curves.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2000

1999

High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

High-Resolution Source Coding for Non-Difference Distortion Measures: The Rate-Distortion Function.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

On the rate-distortion function of random vectors and stationary sources with mixed distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

1998

Radial basis function networks and complexity regularization in function learning.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks, 1998

The Minimax Distortion Redundancy in Empirical Quantizer Design.

[BibT_eX]

[DOI]

Peter L. Bartlett

IEEE Trans. Inf. Theory, 1998

A Polygonal Line Algorithm for Constructing Principal Curves.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 11, [NIPS Conference, Denver, Colorado, USA, November 30, 1998

The Multiple Description Rate Region for High Resolution Source Coding.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

Existence of optimal prefix codes for infinite source alphabets.

[BibT_eX]

[DOI]

Vahid Tarokh

IEEE Trans. Inf. Theory, 1997

Empirical quantizer design in the presence of source noise or channel noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

A Minimax Lower Bound for Empirical Quantizer Design.

[BibT_eX]

[DOI]

Peter L. Bartlett

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Nonparametric estimation and classification using radial basis function nets and empirical risk minimization.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks, 1996

On the cost of finite block length in quantizing unbounded memoryless sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Radial basis function networks and nonparametric classification: complexity regularization and rates of convergence.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Pattern Recognition, 1996

Designing Vector Quantizers in the Presence of Source Noise or Channel Noise.

[BibT_eX]

[DOI]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

Fixed-rate universal lossy source coding and rates of convergence for memoryless sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

On the asymptotic tightness of the Shannon lower bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Universal source coding with codebook transmission.

[BibT_eX]

[DOI]

Anurag Bist

IEEE Trans. Commun., 1994

Nonparametric classification using radial basis function nets and empirical risk minimization.

[BibT_eX]

[DOI]

Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994

1993

Corrected proof of de Buda's theorem.

[BibT_eX]

Christian Schlegel

IEEE Trans. Inf. Theory, 1993

Fast Nearest-Neighbor Search in Dissimilarity Spaces.

[BibT_eX]

[DOI]

András Faragó

IEEE Trans. Pattern Anal. Mach. Intell., 1993

Universality and Rates of Convergence in Lossy Source Coding.

[BibT_eX]

[DOI]