It is demonstrated that depth-first layouts of $k^2$-trees provide a practical and efficient alternative to traditional layouts, improving both compression and computational performance in matrix operations.
Gabriel Carmona, P. Ferragina, Giovanni Manzini et al.· arXiv.org· 0 citations
Software is a first-class scientific object, yet validated links between source code and the scholarly record remain largely absent from the Linked Open Data (LOD) cloud, isolating archived artefacts from semantic discovery. This paper presents an end-to-end reconciliation pipeline that harvests, validates, and models...
Camillo Carlo Pellizzari di San Girolamo, Francesco Tosoni· 0 citations
Grammar-compressed matrices (the mm-repair family) store a matrix's non-zero structure as a RePair straight-line program (SLP), supporting matrix-vector products in time and space proportional to the compressed size, and a CUDA implementation shows a clear space advantage.
Francesco Tosoni, G. Mencagli· arXiv.org· 0 citations
This work presents MediaWiki Code2Code Search, a neural retrieval system for semantic code-to-code discovery, and demonstrates superior performance over the BM25 baseline, with gains most pronounced in name-obfuscated tasks where lexical methods fail.
Francesco Tosoni· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.