A practical method for compressing sparse matrices with variant entries
From MaRDI portal
Recommendations
- Sparsification of matrices and compressed sensing
- Computational Science – ICCS 2005
- On the Compression of Low Rank Matrices
- An optimal storage format for sparse matrices
- Making sparse matrices sparser: Computational results
- A compact sparse matrix representation using random hash functions
- scientific article; zbMATH DE number 3905737
- An efficient storage format for large sparse matrices
- Exploiting sparsity in difference-bound matrices
- scientific article; zbMATH DE number 51442
Cites work
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- A Method for Improving String Pattern Matching Machines
- A direct method for the solution of large sparse systems of linear equations
- A practical method for reducing sparse matrices with invariant entries
- Efficient string matching
- Storing a sparse table
Cited in
(5)- A fast and oblivious matrix compression algorithm for Volterra integral operators
- A transposition algorithm for the factorizable sparse matrix
- A compact sparse matrix representation using random hash functions
- Compression of sparse matrices by blocked Rice coding
- A fast and compact technique of implementing transition tables for finite state automata
This page was built for publication: A practical method for compressing sparse matrices with variant entries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479513)
