1 citations · 3 across the 6 of their papers we have counts for
6 papers
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…
2FA Sketch: Two-Factor Armor Sketch for Accurate and Efficient Heavy Hitter Detection in Data Streams
Xilai Liu, Xinyi Zhang, Bingqing Liu +3
Detecting heavy hitters, which are flows exceeding a specified threshold, is crucial for network measurement, but it faces challenges due to increasing throughput and memory constr…
Fast and Accurate Graph Stream Summarization
Xiangyang Gou, Lei Zou, Chenxingyu Zhao +1
A graph stream is a continuous sequence of data items, in which each item indicates an edge, including its two endpoints and edge weight. It forms a dynamic graph that changes with…
FISF: Better User Experience using Smaller Bandwidth for Panoramic Virtual Reality Video
Lun Wang, Damai Dai, Jie Jiang +5
The panoramic video is widely used to build virtual reality (VR) and is expected to be one of the next generation Killer-Apps. Transmitting panoramic VR videos is a challenging tas…
SF-sketch: A Two-stage Sketch for Data Streams
Tong Yang, Lingtong Liu, Yibo Yan +5
A sketch is a probabilistic data structure used to record frequencies of items in a multi-set. Sketches are widely used in various fields, especially those that involve processing…
A Shifting Bloom Filter Framework for Set Queries
Tong Yang, Alex X. Liu, Muhammad Shahzad +5
Set queries are fundamental operations in computer systems and applications.This paper addresses the fundamental problem of designing a probabilistic data structure that can quickl…