1 citations · 1 across the 4 of their papers we have counts for
Showing cs.ARShow all
2 papers · 1 filter
cs.AR2025
RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs
Yanru Chen, Zheyu Li, Keming Fan +5
All-pairs shortest paths (APSP) remains a major bottleneck for large-scale graph analytics, as data movement with cubic complexity overwhelms the bandwidth of conventional memory h…
cs.AR2025
FeNOMS: Enhancing Open Modification Spectral Library Search with In-Storage Processing on Ferroelectric NAND (FeNAND) Flash
Sumukh Pinge, Ashkan Moradifirouzabadi, Keming Fan +29
The rapid expansion of mass spectrometry (MS) data, now exceeding hundreds of terabytes, poses significant challenges for efficient, large-scale library search - a critical compone…