The following pages link to Tamás Linder (Q892325):
Displayed 50 items.
- (Q185242) (redirect page) (← links)
- Near optimality of quantized policies in stochastic control under weak continuity conditions (Q892326) (← links)
- On some convergence properties of the subspace constrained mean shift (Q898066) (← links)
- Finite approximations in discrete-time stochastic control. Quantized models and asymptotic optimality (Q1746073) (← links)
- On source coding with side-information-dependent distortion measures (Q2706007) (← links)
- Optimal entropy-constrained scalar quantization of a uniform source (Q2706008) (← links)
- Optimization and Convergence of Observation Channels in Stochastic Control (Q2903507) (← links)
- Almost Perfect Privacy for Additive Gaussian Privacy Filters (Q2953821) (← links)
- Output Constrained Lossy Source Coding With Limited Common Randomness (Q2977297) (← links)
- Randomized Quantization and Source Coding With Constrained Output Distribution (Q2978807) (← links)
- On Rates of Convergence for Markov Chains Under Random Time State Dependent Drift Criteria (Q2980709) (← links)
- Asymptotic Optimality and Rates of Convergence of Quantized Stationary Policies in Stochastic Control (Q2982865) (← links)
- On Optimal Zero-Delay Coding of Vector Markov Sources (Q2986082) (← links)
- Efficient Tracking of Large Classes of Experts (Q2989689) (← links)
- 10.1162/153244303768966111 (Q3044135) (← links)
- (Q3148816) (← links)
- (Q3174159) (← links)
- Codecell convexity in optimal entropy-constrained vector quantization (Q3546965) (← links)
- Do optimal entropy-constrained quantizers have a finite or infinite number of codewords? (Q3546967) (← links)
- Causal coding of stationary sources and individual sequences with high resolution (Q3547267) (← links)
- Symbol-Based Modeling and Coding of Block Markov Sources (Q3547917) (← links)
- Tracking the Best Quantizer (Q3604615) (← links)
- Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints (Q3604665) (← links)
- (Q4016319) (← links)
- (Q4016326) (← links)
- Corrected proof of de Buda's theorem (lattice channel codes) (Q4307397) (← links)
- Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization (Q4308806) (← links)
- Empirical quantizer design in the presence of source noise or channel noise (Q4340329) (← links)
- Existence of optimal prefix codes for infinite source alphabets (Q4392408) (← links)
- On the rate-distortion function of random vectors and stationary sources with mixed distributions (Q4503407) (← links)
- A zero-delay sequential scheme for lossy coding of individual sequences (Q4544688) (← links)
- On the structure of optimal entropy-constrained scalar quantizers (Q4544798) (← links)
- A Lagrangian formulation of Zador's entropy-constrained quantization theorem (Q4544822) (← links)
- On the training distortion of vector quantizers (Q4545788) (← links)
- On the Optimal Performance in Asymmetric Gaussian Wireless Sensor Networks With Fading (Q4570226) (← links)
- Channel-Optimized Quantization With Soft-Decision Demodulation for Space–Time Orthogonal Block-Coded Channels (Q4587983) (← links)
- Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes (Q4589420) (← links)
- On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces (Q4595952) (← links)
- Capacity of Burst Noise-Erasure Channels With and Without Feedback and Input Cost (Q4611434) (← links)
- Estimation Efficiency Under Privacy Constraints (Q4629912) (← links)
- Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates (Q4677622) (← links)
- Mismatch in high-rate entropy-constrained vector quantization (Q4680083) (← links)
- The minimax distortion redundancy in empirical quantizer design (Q4701158) (← links)
- High-resolution source coding for non-difference distortion measures: the rate-distortion function (Q4701300) (← links)
- High-resolution source coding for non-difference distortion measures: multidimensional companding (Q4701301) (← links)
- Fixed-rate universal lossy source coding and rates of convergence for memoryless sources (Q4836893) (← links)
- Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding (Q4850276) (← links)
- On the asymptotic tightness of the Shannon lower bound (Q4850301) (← links)
- On the cost of finite block length in quantizing unbounded memoryless sources (Q4885678) (← links)
- Random-Coding Lower Bounds for the Error Exponent of Joint Quantization and Watermarking Systems (Q4975929) (← links)