On approximate pattern matching for a class of Gibbs random fields
From MaRDI portal
Publication:997946
Recommendations
- Stochastic approximation algorithms for partition function estimation of Gibbs random fields
- An efficient estimator for Gibbs random fields
- On Gibbsianness of random fields
- Gibbsian random fields. The general case
- scientific article; zbMATH DE number 1208108
- Approximating Hidden Gaussian Markov Random Fields
- Approximate Bayes model selection procedures for Gibbs-Markov random fields
- scientific article; zbMATH DE number 4163978
Cites Work
- scientific article; zbMATH DE number 47625 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 783366 (Why is no real title available?)
- scientific article; zbMATH DE number 3318548 (Why is no real title available?)
- A suboptimal lossy data compression based on approximate pattern matching
- Exponential distribution for the occurrence of rare patterns in Gibbsian random fields
- Gibbs measures and phase transitions
- Pattern matching and lossy data compression on random fields
- Source coding, large deviations, and approximate pattern matching
- The asymptotics of waiting times between stationary processes, allowing distortion
Cited In (3)
This page was built for publication: On approximate pattern matching for a class of Gibbs random fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997946)