On the public citation graph

Context weighting for general finite-context sources

0 signed · 58 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0890-5401(89)90010-2openalex-snapshot
Inferring decision trees using the minimum description lenght principle
inferredcites →https://doi.org/10.1109/18.135641openalex-snapshot
A sequential algorithm for the universal coding of finite memory sources
inferredcites →https://doi.org/10.1109/18.312161openalex-snapshot
Optimal sequential probability assignment for individual sequences
inferredcites →https://doi.org/10.1109/18.382011openalex-snapshot
A universal finite memory source
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/isit.1993.748374openalex-snapshot
Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1112/blms/23.1.106openalex-snapshot
STOCHASTIC COMPLEXITY IN STATISTICAL INQUIRY

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471219282.eot142openalex-snapshot
Rate‐Distortion Theory
inferred← citeshttps://doi.org/10.1002/047174882x.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-28368-0_20openalex-snapshot
Efficient Implementation of True Random Number Generator Based on SRAM PUFs
inferred← citeshttps://doi.org/10.1007/s11760-016-0972-8openalex-snapshot
Highly efficient nonlinear regression for big data with lexicographical splitting
inferred← citeshttps://doi.org/10.1007/s13389-019-00208-4openalex-snapshot
On the feasibility of deriving cryptographic keys from MEMS sensors
inferred← citeshttps://doi.org/10.1016/j.apenergy.2019.01.019openalex-snapshot
Residential activity pattern modelling through stochastic chains of variable memory length
inferred← citeshttps://doi.org/10.1016/j.sigpro.2010.09.007openalex-snapshot
A tree-weighting approach to sequential decision problems with multiplicative loss
inferred← citeshttps://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferred← citeshttps://doi.org/10.1109/18.720552openalex-snapshot
Lossy source coding
inferred← citeshttps://doi.org/10.1109/18.930925openalex-snapshot
Adaptive context trees and text clustering
inferred← citeshttps://doi.org/10.1109/access.2021.3127957openalex-snapshot
NASCUP: Nucleic Acid Sequence Classification by Universal Probability
inferred← citeshttps://doi.org/10.1109/bmsb.2014.6873552openalex-snapshot
Regional context model and dynamic Huffman binarization for adaptive entropy coding of multimedia
inferred← citeshttps://doi.org/10.1109/cecnet.2011.5769096openalex-snapshot
Magnetic flux leakage data lossless compression based on Context Tree Weighting
inferred← citeshttps://doi.org/10.1109/cifer.2014.6924080openalex-snapshot
Frequency effects on predictability of stock returns
inferred← citeshttps://doi.org/10.1109/dcc.2000.838200openalex-snapshot
Some notes on the context mapping function in lossless data compression
inferred← citeshttps://doi.org/10.1109/dcc.2010.23openalex-snapshot
Efficient Algorithms for Constructing Optimal Bi-directional Context Sets
inferred← citeshttps://doi.org/10.1109/glocom.2006.80openalex-snapshot
CTH08-6: Context Based Decoding of Split-LDPC Codes
inferred← citeshttps://doi.org/10.1109/isit.2005.1523546openalex-snapshot
Multi-directional context sets with applications to universal denoising and compression
inferred← citeshttps://doi.org/10.1109/isit.2006.261765openalex-snapshot
Estimating the Secrecy-Rate of Physical Unclonable Functions with the Context-Tree Weighting Method
inferred← citeshttps://doi.org/10.1109/isit.2016.7541493openalex-snapshot
Context Set Weighting method
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206850openalex-snapshot
Time Series Analysis with Bayesian Context Trees: Classical Asymptotics and Finite-n Bounds
inferred← citeshttps://doi.org/10.1109/ita.2007.4357608openalex-snapshot
Less naive Bayes spai detection
inferred← citeshttps://doi.org/10.1109/itw.2004.1405281openalex-snapshot
Efficient pruning of bi-directional context trees with applications to universal denoising and compression
inferred← citeshttps://doi.org/10.1109/mlsp.2006.275535openalex-snapshot
Map Model Selection for Context Trees
inferred← citeshttps://doi.org/10.1109/siu.2016.7495969openalex-snapshot
A tree-based solution to nonlinear regression problem
inferred← citeshttps://doi.org/10.1109/ssci.2015.106openalex-snapshot
Maximum Entropy Production Principle for Stock Returns
inferred← citeshttps://doi.org/10.1109/ssp.2007.4301233openalex-snapshot
Constrained Complexity Generalized Context-Tree Algorithms
inferred← citeshttps://doi.org/10.1109/tcomm.2009.04.070275openalex-snapshot
Universal source controlled channel decoding with nonsystematic quick-look-in turbo codes
inferred← citeshttps://doi.org/10.1109/tit.2008.2008117openalex-snapshot
Universal Estimation of Erasure Entropy
inferred← citeshttps://doi.org/10.1109/tit.2011.2165818openalex-snapshot
On Multi-Directional Context Sets
inferred← citeshttps://doi.org/10.1109/tit.2023.3313114openalex-snapshot
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2854796openalex-snapshot
Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures
inferred← citeshttps://doi.org/10.1109/tsp.2015.2458784openalex-snapshot
Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression
inferred← citeshttps://doi.org/10.1109/tsp.2016.2607141openalex-snapshot
Sequential Prediction Over Hierarchical Structures
inferred← citeshttps://doi.org/10.1111/rssb.12511openalex-snapshot
Bayesian Context Trees: Modelling and Exact Inference for Discrete Time Series
inferred← citeshttps://doi.org/10.1145/1867635.1867644openalex-snapshot
Hardware intrinsic security from D flip-flops
inferred← citeshttps://doi.org/10.1145/2976749.2978295openalex-snapshot
MEMS Gyroscopes as Physical Unclonable Functions
inferred← citeshttps://doi.org/10.1186/s40965-018-0052-9openalex-snapshot
Distributed Context Tree Weighting (CTW) for route prediction
inferred← citeshttps://doi.org/10.1198/1061860043524openalex-snapshot
Variable Length Markov Chains: Methodology, Computing, and Software
inferred← citeshttps://doi.org/10.1214/074921707000000391openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.14209/sbrt.2005.102openalex-snapshot
Aplicando o Algoritmo CTW no Padrão JPEG-LS
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.1613/jair.3125openalex-snapshot
A Monte-Carlo AIXI Approximation
inferred← citeshttps://doi.org/10.3390/entropy-e10020071openalex-snapshot
Estimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation Study
inferred← citeshttps://doi.org/10.4310/cis.2002.v2.n1.a2openalex-snapshot
Structured grammar-based codes for universal lossless data compression
inferred← citeshttps://doi.org/10.46298/dmtcs.3555openalex-snapshot
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
inferred← citeshttps://doi.org/10.48550/arxiv.2109.09212openalex-snapshot
Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605793openalex-snapshot
PAC-Bayesian inductive and transductive learning
inferred← citeshttps://doi.org/10.6100/ir642839openalex-snapshot
Secret-key rates and privacy leakage in biometric systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.