Pages that link to "Item:Q4371886"
From MaRDI portal
The following pages link to A suboptimal lossy data compression based on approximate pattern matching (Q4371886):
Displaying 13 items.
- Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy (Q990884) (← links)
- On approximate pattern matching for a class of Gibbs random fields (Q997946) (← links)
- The asymptotics of waiting times between stationary processes, allowing distortion (Q1305418) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Stochastic sub-additivity approach to the conditional large deviation principle (Q1872225) (← links)
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases (Q1945151) (← links)
- Shortest distance between multiple orbits and generalized fractal dimensions (Q2035433) (← links)
- Longest common substring for random subshifts of finite type (Q2077341) (← links)
- Matching strings in encoded sequences (Q2174991) (← links)
- Random databases with approximate record matching (Q2270185) (← links)
- An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models (Q4887060) (← links)
- R\'enyi entropy and pattern matching for run-length encoded sequences (Q4989421) (← links)
- The Rényi entropy function and the large deviation of short return times (Q5188012) (← links)
