.png){kind=icon}
Return
Cache-Friendly Compressed Boolean Matrices
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-05228-5_9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a new compressed representation of sparse Boolean matrices that enjoys reference locality properties. We build on an existing representation based on LOUDS-deployed cardinal trees, and design one based instead on DFUDS. While this brings various complications, we show that the resulting matrix representation is considerably faster to carry out sums and multiplications, with speedups of up to 60%.
Keywords:
Compact Data Structures
Algebra
Binary Matrices
Cache-Friendly
Journal
S
IF:
0
Papers:
22
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more