Search Results for author:
Found 1 papers, 0 papers with code
Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs
In this paper, to clearly compare the efficiency of various node sampling methods, we first design a cost model and propose two new node sampling methods: one follows the acceptance-rejection paradigm to achieve a better balance between memory and time cost, and the other is optimized for fast sampling the skewed probability distributions existed in natural graphs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
