activity
20192026
most citedA Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets

39 citations · 42 across the 4 of their papers we have counts for

collaborators

5 papers

cs.CR2026

Risk-aware Road-network Trajectory Synthesis under Local Differential Privacy

Hongzhen Xiang, Chenxu Wang, Yumeng Song +5

Road-network trajectory synthesis under local differential privacy (LDP) enables mobility data analysis without uploading raw trajectories to an untrusted server. Existing locally…

cs.LG2026

HOPE: Heterophily-Aware Open-Set Node Classification with Pseudo-Extrapolation

Yumeng Dai, Yue Tan, Yixin Liu +3

Standard open-set node classification methods rely on the homophily assumption, where connected nodes share labels. However, real-world graphs are often heterophilic, exposing the…

cs.SE2024★ 1 cited

Are We There Yet? Unraveling the State-of-the-Art Smart Contract Fuzzers

Shuohan Wu, Zihao Li, Luyi Yan +5

Given the growing importance of smart contracts in various applications, ensuring their security and reliability is critical. Fuzzing, an effective vulnerability detection techniqu…

cs.CR2020★ 2 cited

CLUE: Towards Discovering Locked Cryptocurrencies in Ethereum

Xiaoqi Li, Ting Chen, Xiapu Luo +1

As the most popular blockchain that supports smart contracts, there are already more than 296 thousand kinds of cryptocurrencies built on Ethereum. However, not all cryptocurrencie…

cs.DS2019★ 39 cited

A Memory-Efficient Sketch Method for Estimating High Similarities in Streaming Sets

Pinghui Wang, Yiyan Qi, Yuanming Zhang +4

Estimating set similarity and detecting highly similar sets are fundamental problems in areas such as databases, machine learning, and information retrieval. MinHash is a well-know…