5 citations · 12 across the 11 of their papers we have counts for
12 papers
On Efficient Range-Summability of Ideally IID Random Variables in Two or Higher Dimensions
Jingfan Meng, Huayi Wang, Jun Xu +1
-dimensional (for ) efficient range-summability (D-ERS) of random variables (RVs) is a fundamental algorithmic problem that has applications to two important families of…
A Dyadic Simulation Approach to Efficient Range-Summability
Jingfan Meng, Huayi Wang, Jun Xu +1
Efficient range-summability (ERS) of a long list of random variables is a fundamental algorithmic problem that has applications to three important database applications, namely, da…
MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in Distance
Huayi Wang, Jingfan Meng, Long Gong +2
Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic problem, with numerous applications in many areas of computer science. Locality-sensitive hashing (LSH) is o…
Sliding-Window QPS (SW-QPS): A Perfect Parallel Iterative Switching Algorithm for Input-Queued Switches
Jingfan Meng, Long Gong, Jun +1
In this work, we first propose a parallel batch switching algorithm called Small-Batch Queue-Proportional Sampling (SB-QPS). Compared to other batch switching algorithms, SB-QPS si…
Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Long Gong, Ziheng Liu, Liang Liu +3
Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitco…
Joint Inference on Truth/Rumor and Their Sources in Social Networks
Shan Qu, Ziqi Zhao, Luoyi Fu +2
In the contemporary era of information explosion, we are often faced with the mixture of massive \emph{truth} (true information) and \emph{rumor} (false information) flooded over s…