The following pages link to Run-length encodings (Corresp.) (Q5515793):
Displaying 41 items.
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- Generalized unary coding (Q308487) (← links)
- Fast decoding algorithms for variable-lengths codes (Q424795) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- Mathematical vanity plates (Q536603) (← links)
- Reordering columns for smaller indexes (Q545370) (← links)
- Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
- Parallel lossless image compression using Huffman and arithmetic coding (Q671379) (← links)
- The single-pass perceptual embedded zero-tree coding implementation on DSP (Q745807) (← links)
- Enumeration of constant-weight run-length limited binary sequences (Q764254) (← links)
- Text compression methods (Q805263) (← links)
- A new multistage lattice vector quantization with adaptive subband thresholding for image compression (Q836553) (← links)
- A near-lossless image compression algorithm suitable for hardware design in wireless endoscopy system (Q838890) (← links)
- Binary codes for locally homogeneous sequences (Q845715) (← links)
- Neural associative memory for brain modeling and information retrieval (Q1044686) (← links)
- A compression method for clustered bit-vectors (Q1251634) (← links)
- Rearranging data to maximize the efficiency of compression (Q1263976) (← links)
- Towards efficient positional inverted index (Q1662625) (← links)
- Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
- Supporting random access in files of variable length records (Q1802061) (← links)
- Huffman-type codes for infinite source distributions (Q1804258) (← links)
- Signature files and signature trees. (Q1853015) (← links)
- New compression schemes for natural number sequences (Q2112646) (← links)
- Adaptive succinctness (Q2118203) (← links)
- A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
- Color image steganography scheme using gray invariant in AMBTC compression domain (Q2192928) (← links)
- Binary image compression via monochromatic pattern substitution: sequential and parallel implementations (Q2254061) (← links)
- Universal coding for memoryless sources with countably infinite alphabets (Q2352641) (← links)
- A new algorithm for the embedding of a prediction mechanism into the JPEG2000 coding chain (Q2496310) (← links)
- Searching and encoding for infinite ordered sets (Q3933757) (← links)
- Memory Capacities for Synaptic and Structural Plasticity (Q5189861) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES (Q5358095) (← links)
- Efficient Associative Computation with Discrete Synapses (Q5380385) (← links)
- Distance Transformation on Two-Dimensional Irregular Isothetic Grids (Q5458891) (← links)
- SPACE-TIME SURFACE SIMPLIFICATION AND EDGEBREAKER COMPRESSION FOR 2D CEL ANIMATIONS (Q5485801) (← links)
- A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES (Q5714659) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)
- On the importance of error resilience in visual communications over noisy channels (Q5950277) (← links)
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple (Q6133964) (← links)
- Adaptive succinctness (Q6536273) (← links)
