research
∙
03/10/2021
MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS in L_1 Distance
Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic ...
share
research
∙
10/16/2020
Sliding-Window QPS (SW-QPS): A Perfect Parallel Iterative Switching Algorithm for Input-Queued Switches
In this work, we first propose a parallel batch switching algorithm call...
research
∙
07/29/2020
Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)
Set reconciliation is a fundamental algorithmic problem that arises in m...
research
∙
05/14/2019
QPS-r: A Cost-Effective Crossbar Scheduling Algorithm and Its Stability and Delay Analysis
Parallel iterative maximal matching algorithms (adapted for switching) h...
research
∙
12/18/2017
Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers
Hybrid circuit and packet switching for data center networking (DCN) has...
research
∙
11/08/2017
R(QPS-Serena) and R(QPS-Serenade): Two Novel Augmenting-Path Based Algorithms for Computing Approximate Maximum Weight Matching
In this addendum, we show that the switching algorithm QPS-SERENA can be...
research
∙
10/19/2017
