Now showing items 1-2 of 2
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication
(IEEE Computer Society, 2018-03)
[Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ...