The following pages link to (Q4833659):
Displaying 41 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders'' (Q293392) (← links)
- Compressed matching for feature vectors (Q294934) (← links)
- Location discriminative vocabulary coding for mobile landmark search (Q409174) (← links)
- Fast decoding algorithms for variable-lengths codes (Q424795) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- Efficient index for retrieving top-\(k\) most frequent documents (Q616994) (← links)
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Extensionally defining principles and cases in ethics: an AI model (Q814520) (← links)
- Binary codes for locally homogeneous sequences (Q845715) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- Adaptive text mining: inferring structure from sequences (Q876712) (← links)
- An adaptive image Euclidean distance (Q1005637) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Perfect hashing (Q1391123) (← links)
- Fast pattern matching in indexed texts (Q1566727) (← links)
- Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series (Q1711225) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- Guided blocks WOM codes (Q2094383) (← links)
- Improved alignment-based algorithm for multilingual text compression (Q2254060) (← links)
- Comparison between text compression algorithms in biological sequences (Q2288216) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Compressed data structures: Dictionaries and data-aware measures (Q2465063) (← links)
- New variable-length data compression scheme for solution representation of meta-heuristics (Q2668691) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
- QoRank: A query-dependent ranking model using LSE-based weighted multiple hyperplanes aggregation for information retrieval (Q3072522) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Mining Compressing Sequential Patterns (Q4969924) (← links)
- In-place calculation of minimum-redundancy codes (Q5057451) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
- (Q5389768) (← links)
- An experimental study of a compressed index (Q5944434) (← links)
- Time series compression based on reinforcement learning (Q6052621) (← links)
