![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
- Read more about Smaller RLZ-Compressed Suffix Arrays
- Log in to post comments
Recently it was shown (Puglisi and Zhukova, Proc. SPIRE, 2020) that the suffix array (SA) data structure can be effectively compressed with relative Lempel-Ziv (RLZ) dictionary compression in such a way that arbitrary subar- rays can be rapidly decompressed, thus facilitating compressed indexing. In this paper we describe optimizations to RLZ-compressed SAs, including generation of more effective dictionaries and compact encodings of index components, both of which reduce index size without adversely affecting subarray access speeds relative to other compressed indexes.
- Categories:
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
- Read more about On Elias-Fano for Rank Queries in FM-indexes
- Log in to post comments
We describe methods to support fast rank queries on the Burrows-Wheeler transform (BWT) string S of an input string T on alphabet Σ, in order to support pattern counting queries. Our starting point is an approach previously adopted by several authors, which is to represent S as |Σ| bitvectors, where the bitvector for symbol c has a 1 at position i if and only if S[i] = c, with the bitvec- tors stored in Elias-Fano (EF) encodings, to enable binary rank queries. We first show that the clustering of symbols induced by the BWT makes standard implementations of EF unattractive.
- Categories:
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
![](/sites/all/themes/dataport/images/light-567757_1920.jpg)
- Read more about Compressive Sensing via Unfolded ℓ_0-Constrained Convolutional Sparse Coding
- Log in to post comments
DCC的副本.pdf
![application/pdf PDF icon](/modules/file/icons/application-pdf.png)
- Categories:
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
Deep neural networks (DNNs), despite their performance on a wide variety of tasks, are still out of reach for many applications as they require significant computational resources. In this paper, we present a low-rank based end-to-end deep neural network compression frame- work with the goal of enabling DNNs performance to computationally constrained devices. The proposed framework includes techniques for low-rank based structural approximation, quantization and lossless arithmetic coding.
- Categories:
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
- Read more about DZip: improved general-purpose lossless compression based on novel neural network modeling
- 2 comments
- Log in to post comments
- Categories:
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
Little attention has been given to language support for block-based compression algorithms, despite their high implementation complexity. Current implementations have to deal with both the intricacies of the algorithm itself, as well as the low-level optimizations necessary for generating fast code. However, many block-based compression algorithms share a common structure in terms of their data representations, data partitioning operations, and data traversals.
In this work, we propose a set of high-level language abstractions that can succinctly capture this structure.
- Categories:
![](https://sigport.org/sites/default/files/styles/list/public/rolo-compressor-1423855.jpg?itok=Sox0EnIj)
- Read more about Backward Weighted Coding
- Log in to post comments
Extending recently suggested methods, a new dynamic compression algorithm is proposed, which assigns larger weights to characters that have just been coded by means of an increasing weight function. Empirical results present its efficient compression performance, which, for input files with locally skewed distributions, can improve beyond the lower bound given by the entropy for static encoding, at the price of slower running times for compression, and comparable time for decompression.
- Categories:
![](https://sigport.org/sites/default/files/styles/home/public/DCC_2021_0.jpg?itok=NdeMrA5c)
- Read more about Compact Representation of Spatial Hierarchies and Topological Relationships
- Log in to post comments
The topological model for spatial objects identifies common boundaries between regions, explicitly storing adjacency relations, which not only improves the efficiency of topology-related queries, but also provides advantages such as avoiding data duplication and facilitating data consistency. Recently, a compact representation of the topological model based on planar graph embeddings was proposed.
- Categories:
![](https://sigport.org/sites/default/files/styles/list/public/usb-flash-drive-1-1236600.jpg?itok=5po6fGwJ)
- Read more about Guided Blocks WOM codes
- Log in to post comments
A binary Write Once Memory (wom) device is a storage mechanism in which a 0-bit can be overwritten much more easily than a 1-bit. A famous example is the flash memory technology, where $0 \rightarrow 1$ transitions are allowed, but $1\rightarrow 0$ transitions require a costly erase procedure and are therefore prohibited. A {\sc wom} code is a coding scheme that permits multiple writes to the {\sc wom} without violating the {\sc wom} rule.
The properties of {\sc wom}
attracted attention even before flash memory was invented.
- Categories: