On the public citation graph
Coding of Sets of Words
0 signed · 50 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16761-7_67openalex-snapshot
Some further results on digital search trees
inferredcites →https://doi.org/10.1007/bfb0026666openalex-snapshot
Naive (Bayes) at forty: The independence assumption in information retrieval
inferredcites →https://doi.org/10.1016/0020-0190(93)90068-kopenalex-snapshot
Improved behaviour of tries by adaptive branching
inferredcites →https://doi.org/10.1016/0304-3975(80)90073-0openalex-snapshot
Lexicographic generation of ordered trees
inferredcites →https://doi.org/10.1016/0304-3975(91)90050-copenalex-snapshot
A characterization of digital search trees from the successful search viewpoint
inferredcites →https://doi.org/10.1016/j.cviu.2007.09.014openalex-snapshot
Speeded-Up Robust Features (SURF)
inferredcites →https://doi.org/10.1016/j.ipl.2005.06.008openalex-snapshot
On the average depth of asymmetric LC-tries
inferredcites →https://doi.org/10.1016/j.ipl.2005.10.006openalex-snapshot
Compressing probability distributions
inferredcites →https://doi.org/10.1016/s0020-0255(01)00101-3openalex-snapshot
On the average redundancy rate of the Lempel–Ziv code with the k-error protocol
inferredcites →https://doi.org/10.1016/s0304-3975(01)00415-7openalex-snapshot
Some results on tries with adaptive branching
inferredcites →https://doi.org/10.1023/b:visi.0000029664.99615.94openalex-snapshot
Distinctive Image Features from Scale-Invariant Keypoints
inferredcites →https://doi.org/10.1093/comjnl/34.5.438openalex-snapshot
A Survey on Binary Tree Codings
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
inferredcites →https://doi.org/10.1109/cvpr.2009.5206733openalex-snapshot
CHoG: Compressed histogram of gradients A low bit-rate feature descriptor
inferredcites →https://doi.org/10.1109/cvprw.2010.5543242openalex-snapshot
Quantization schemes for low bitrate Compressed Histogram of Gradients descriptors
inferredcites →https://doi.org/10.1109/dcc.2006.78openalex-snapshot
Toward a Source Coding Theory for Sets
inferredcites →https://doi.org/10.1109/dcc.2009.33openalex-snapshot
Tree Histogram Coding for Mobile Image Matching
inferredcites →https://doi.org/10.1109/isit.2006.261984openalex-snapshot
Precise Asymptotic Analysis of the Tunstall Code
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1109/tit.1986.1057217openalex-snapshot
On multiset decipherable codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2004.830754openalex-snapshot
Compression of Words Over a Partially Commutative Alphabet
inferredcites →https://doi.org/10.1142/s0129054190000291openalex-snapshot
TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
inferredcites →https://doi.org/10.1145/1460096.1460165openalex-snapshot
Outdoors augmented reality on mobile phone using loxel-based visual feature organization
inferredcites →https://doi.org/10.1145/362686.362693openalex-snapshot
File structures using hashing functions
inferredcites →https://doi.org/10.1214/aop/1176993000openalex-snapshot
Asymptotical Growth of a Class of Random Trees
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/dcc.2013.83openalex-snapshot
Considerations and Algorithms for Compression of Sets
inferred← citeshttps://doi.org/10.1109/dcc.2014.89openalex-snapshot
Compressing Sets and Multisets of Sequences
inferred← citeshttps://doi.org/10.1109/dcc.2015.72openalex-snapshot
Overview of the MPEG CDVS Standard
inferred← citeshttps://doi.org/10.1109/dcc.2017.60openalex-snapshot
Universal Source Coding of Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00061openalex-snapshot
The Twelvefold Way of Non-Sequential Lossless Compression
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00040openalex-snapshot
Compressing Multisets with Large Alphabets
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413447openalex-snapshot
Predictive Coding for Lossless Dataset Compression
inferred← citeshttps://doi.org/10.1109/iccv.2017.523openalex-snapshot
AnnArbor: Approximate Nearest Neighbors Using Arborescence Coding
inferred← citeshttps://doi.org/10.1109/iccvw.2011.6130219openalex-snapshot
Compressing Feature Sets with Digital Search Trees
inferred← citeshttps://doi.org/10.1109/isit.2011.6033752openalex-snapshot
Codes for unordered sets of words
inferred← citeshttps://doi.org/10.1109/itw.2012.6404756openalex-snapshot
Compressing multisets using tries
inferred← citeshttps://doi.org/10.1109/jsait.2023.3245417openalex-snapshot
Compressing Multisets With Large Alphabets
inferred← citeshttps://doi.org/10.1109/jsait.2023.3261819openalex-snapshot
Universal and Succinct Source Coding of Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/tip.2015.2500034openalex-snapshot
Overview of the MPEG-CDVS Standard
inferred← citeshttps://doi.org/10.1145/3711896.3737034openalex-snapshot
Lossless Set Compression by Binary Tree Coding
inferred← citeshttps://doi.org/10.3390/e25101406openalex-snapshot
Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics
inferred← citeshttps://doi.org/10.3390/e26060513openalex-snapshot
Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6986openalex-snapshot
Two Embedding Theorems for Data with Equivalences under Finite Group Action
inferred← citeshttps://doi.org/10.48550/arxiv.1402.1936openalex-snapshot
Integer Set Compression and Statistical Modeling
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.