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 this paper ...

Compressive sensing is a new field in signal processing and applied mathematics. It allows one to simultaneously sample and compress signals which are known to have a sparse representation in a known basis or dictionary ...

In an effort to calibrate assessment methods of existing earth structures, a new database with compression and bending tests on unbaked earth specimens was assembled. The data-collection database includes 2670 tests with ...

This work offers a necessary and sufficient condition for a stationary and ergodic process to be l(p)-compressible in the sense proposed by Amini, Unser and Marvasti ["Compressibility of deterministic and random infinity ...

One of the main issues regarding the use of charcoal in metallurical processes is its mechanical strength, which is much lower than coke. There is no defined standard to determine charcoal compression strength, and the ...

Semistatic word-based byte-oriented compressors are known to be attractive alternatives to compress natural language texts. With compression ratios around 30-35%, they allow fast direct searching of compressed text. In ...

We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. Our solution builds on the factorization performed by SAIS during suffix sorting. We ...