arXiv CS
open access
AdaBool: Sparse Boolean Matrix Processing with Adaptive Data Representation
Many data processing tasks revolve around determining whether logical relationships exist between two sets of entities, a pattern that can be naturally modeled as Sparse Boolean Matrix Multiplication (SpBMM). Under Boolean semantics, matrix representations no longer need to store numerical values an
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
- AdaBool: Sparse Boolean Matrix Processing with Adaptive Data Representation#1356600
- SpSYRK: Half the Work in Distributed Sparse Matrix Multiplication#441743
- BaCP: Backbone Contrastive Pruning for Preserving Representations in Extremely Sparse Neural Networks#1186838
- ParamSpMM: Adaptive and Efficient Sparse Matrix-Matrix Multiplication on GPUs for GNNs#194289
- On Associative Neural Networks for Sparse Patterns with Large Capacities#1345568
Record · ID 1348824
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