arXiv (All)
open access
Computation-Friendly Compression of Matrices: Speeding up Linear and Boolean Algebra
Large sparse matrices---adjacency matrices of web and social graphs, feature matrices of machine-learning pipelines, the relations of graph databases---are routinely compressed to save space. Classical compressors, however, force the matrix to be decompressed before it can be used, so the space savi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simultaneous Matrix-Free HSS Compression and Factorization with Adaptive Ranks#1341795
- Memory-Time Trade-offs for Floating-Point Compression in Industrial Hierarchical Matrix Solvers#291691
- Lanczos with compression for symmetric eigenvalue problems#635753
- Lanczos with compression for symmetric eigenvalue problems#633404
- Exact Nonnegative Matrix Factorization via Cone-Ray Witnesses: Certificates, a One-Sided Solver, and a Findability Phase Transition#652362
Record · ID 1458832
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive