1 citations · 1 across the 6 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Dynamic Structural Clustering on Graphs
Boyu Ruan, Junhao Gan, Hao Wu +1
Structural Clustering () is one of the most popular graph clustering paradigms. In this paper, we consider under two commonly adapted similarities, namely Jaccard…
cs.DS2021
Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches
Hao Wu, Anthony Wirth
We present two new local differentially private algorithms for frequency estimation. One solves the fundamental frequency oracle problem; the other solves the well-known heavy hitt…
cs.DS2021
Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push
Hao Wu, Junhao Gan, Zhewei Wei +1
Personalized PageRank (PPR) is a critical measure of the importance of a node t to a source node s in a graph. The Single-Source PPR (SSPPR) query computes the PPR's of all the nod…