2 citations · 3 across the 10 of their papers we have counts for
12 papers
U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
Huayi Wang, Jingfan Meng, Jun Xu
Approximate nearest neighbor search under universal L_p metrics (ANNS-U-L_p) is an important and challenging research problem, as it requires answering queries under all possible p…
METTLE: Efficient Streaming Erasure Code with Peeling Decodability
Qianru Yu, Tianji Yang, Jingfan Meng +1
In this work, we solve a long-standing open problem in coding theory with broad applications in networking and systems: designing an erasure code that simultaneously satisfies thre…
CommonSense: Efficient Set Intersection (SetX) Protocol Based on Compressed Sensing
Jingfan Meng, Tianji Yang, Jun Xu
In the set reconciliation (\textsf{SetR}) problem, two parties Alice and Bob, holding sets and , communicate to learn the symmetric difference $\mathsf{A}…
OddEEC: A New Sketch Technique for Error Estimating Coding
Huayi Wang, Jingfan Meng, Jun Xu
Error estimating coding (EEC) is a standard technique for estimating the number of bit errors during packet transmission over wireless networks. In this paper, we propose OddEEC, a…
Rethinking Similarity Search: Embracing Smarter Mechanisms over Smarter Data
Renzhi Wu, Jingfan Meng, Jie Jeff Xu +2
In this vision paper, we propose a shift in perspective for improving the effectiveness of similarity search. Rather than focusing solely on enhancing the data quality, particularl…
RECIPE: Rateless Erasure Codes Induced by Protocol-Based Encoding
Jingfan Meng, Ziheng Liu, Yiwei Wang +1
LT (Luby transform) codes are a celebrated family of rateless erasure codes (RECs). Most of existing LT codes were designed for applications in which a centralized encoder possesse…
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…
BLAG: Bandit On Large Action Set Graph
Yucheng Lu, Xudong Wu, Jingfan Meng +2
Information diffusion in social networks facilitates rapid and large-scale propagation of content. However, spontaneous diffusion behavior could also lead to the cascading of sensi…
Evolving Influence Maximization in Evolving Networks
Xudong Wu, Luoyi Fu, Zixin Zhang +3
Influence Maximization (IM) aims to maximize the number of people that become aware of a product by finding the `best' set of `seed' users to initiate the product advertisement. Un…