Pages that link to "Item:Q3794067"
From MaRDI portal
The following pages link to A locally adaptive data compression scheme (Q3794067):
Displaying 38 items.
- Using information theory approach to randomness testing (Q110728) (← links)
- On list update with locality of reference (Q269460) (← links)
- Revisiting the COUNTER algorithms for list update (Q287261) (← links)
- List update with probabilistic locality of reference (Q436596) (← links)
- On the list update problem with advice (Q515679) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- Dynamic asymmetric communication (Q975489) (← links)
- Move-to-front, distance coding, and inversion frequencies revisited (Q982665) (← links)
- Context exhumation after the Burrows-Wheeler transform (Q1041774) (← links)
- A competitive analysis of the list update problem with lookahead (Q1128665) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Randomized competitive algorithms for the list update problem (Q1312185) (← links)
- Measuring the clustering effect of BWT via RLE (Q1676309) (← links)
- On some statistical properties of the ``Book Stack'' transformation (Q1708004) (← links)
- An exact formula for the move-to-front rule for self-organizing lists (Q1908208) (← links)
- Time-universal data compression (Q2004897) (← links)
- A novel legitimacy preserving data hiding scheme based on LAS compressed code of VQ index tables (Q2014192) (← links)
- Asymptotically most powerful tests for random number generators (Q2059421) (← links)
- Weighted forward looking adaptive coding (Q2166764) (← links)
- Paid exchanges are worth the price (Q2182321) (← links)
- Efficient chain code compression with interpolative coding (Q2195467) (← links)
- Parameterized analysis of paging and list update algorithms (Q2346961) (← links)
- Burrows-Wheeler compression: Principles and reflections (Q2465053) (← links)
- A simpler analysis of Burrows-Wheeler-based compression (Q2465054) (← links)
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
- Compressing table data with column dependency (Q2465060) (← links)
- Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576) (← links)
- Second step algorithms in the Burrows-Wheeler compression algorithm (Q2783312) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- The Vcodex Platform for Data Compression (Q3612878) (← links)
- Some Results for Elementary Operations (Q3644718) (← links)
- Investigation of block-sorting of multiset permutations (Q4652742) (← links)
- (Q4791703) (← links)
- An experimental study of a compressed index (Q5944434) (← links)
- Optimal encoding of non-stationary sources (Q5944439) (← links)
- Lossless image compression using list update algorithms (Q6536244) (← links)
