Pages that link to "Item:Q3671882"
From MaRDI portal
The following pages link to A universal data compression system (Q3671882):
Displaying 50 items.
- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets (Q358679) (← links)
- Almost Gibbsianness and parsimonious description of the decimated 2d-Ising model (Q368672) (← links)
- Partially observed Markov random fields are variable neighborhood random fields (Q438747) (← links)
- Recursive learning for sparse Markov models (Q516456) (← links)
- Bayesian analysis of variable-order, reversible Markov chains (Q548538) (← links)
- Neighborhood radius estimation for variable-neighborhood random fields (Q554466) (← links)
- The power of amnesia: Learning probabilistic automata with variable memory length (Q676238) (← links)
- Variable length local decoding and alignment-free sequence comparison (Q690447) (← links)
- Chains of infinite order, chains with memory of variable length, and maps of the interval (Q690624) (← links)
- Rule generation for categorical time series with Markov assumptions (Q692942) (← links)
- Context tree selection: a unifying view (Q719769) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Lossless compression of map contours by context tree modeling of chain codes (Q856458) (← links)
- Nonparametric statistical inference for the context tree of a stationary ergodic process (Q887255) (← links)
- Stochastically perturbed chains of variable memory (Q888259) (← links)
- Stratified graphical models -- context-specific independence in graphical models (Q899060) (← links)
- Some upper bounds for the rate of convergence of penalized likelihood context tree estimators (Q985992) (← links)
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm (Q1020542) (← links)
- Efficient and adaptive post-model-selection estimators (Q1298924) (← links)
- On-line maximum likelihood prediction with respect to general loss functions (Q1370862) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- Persistent random walks. I. Recurrence versus transience (Q1745264) (← links)
- Relevant states and memory in Markov chain bootstrapping and simulation (Q1752182) (← links)
- Entropic repulsion and lack of the \(g\)-measure property for Dyson models (Q1795122) (← links)
- Bootstraps for time series (Q1872593) (← links)
- Variable length Markov chains (Q1970475) (← links)
- From data to stochastic models (Q1976343) (← links)
- Phase transition for infinite systems of spiking neurons (Q1990119) (← links)
- Local theorems for (multidimensional) additive functionals of semi-Markov chains (Q2029795) (← links)
- Variable length memory chains: characterization of stationary probability measures (Q2040105) (← links)
- Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons (Q2137756) (← links)
- Coupling and perturbation techniques for categorical time series (Q2203638) (← links)
- Convergence to equilibrium for time-inhomogeneous jump diffusions with state-dependent jump intensity (Q2209322) (← links)
- Testing statistical hypothesis on random trees and applications to the protein classification problem (Q2270660) (← links)
- Using a VOM model for reconstructing potential coding regions in EST sequences (Q2271692) (← links)
- Algorithms for learning parsimonious context trees (Q2425237) (← links)
- Context tree selection and linguistic rhythm retrieval from written texts (Q2428742) (← links)
- Detecting renewal states in chains of variable length via intrinsic Bayes factors (Q2680304) (← links)
- Divergent Perpetuities Modulated by Regime Switches (Q2841131) (← links)
- Robust Model Selection for Stochastic Processes (Q2876227) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- Sparse Markov Chains for Sequence Data (Q2922158) (← links)
- Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme (Q3173003) (← links)
- Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition (Q3389500) (← links)
- Probability and algorithmics: a focus on some recent developments (Q4606438) (← links)
- Joint Estimation of Intersecting Context Tree Models (Q4923058) (← links)
- Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm (Q4982617) (← links)
- Variable length Markov chain with exogenous covariates (Q5063328) (← links)
- Non-regular <i>g</i>-measures and variable length memory chains (Q5136519) (← links)
- Uncommon suffix tries (Q5175232) (← links)
