Picture for Yiqiu Wang

Yiqiu Wang

Cramér-Rao Bound Analysis and Beamforming Design for Integrated Sensing and Communication with Extended Targets

Add code
Jun 04, 2024
Figure 1 for Cramér-Rao Bound Analysis and Beamforming Design for Integrated Sensing and Communication with Extended Targets
Figure 2 for Cramér-Rao Bound Analysis and Beamforming Design for Integrated Sensing and Communication with Extended Targets
Figure 3 for Cramér-Rao Bound Analysis and Beamforming Design for Integrated Sensing and Communication with Extended Targets
Figure 4 for Cramér-Rao Bound Analysis and Beamforming Design for Integrated Sensing and Communication with Extended Targets
Viaarxiv icon

Beamforming Design for Integrated Sensing and Communication with Extended Target

Add code
Dec 17, 2023
Viaarxiv icon

ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain

Add code
Jun 08, 2021
Figure 1 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Figure 2 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Figure 3 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Figure 4 for ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain
Viaarxiv icon

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

Add code
Apr 02, 2021
Figure 1 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Figure 2 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Figure 3 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Figure 4 for Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Viaarxiv icon

Theoretically-Efficient and Practical Parallel DBSCAN

Add code
Dec 12, 2019
Figure 1 for Theoretically-Efficient and Practical Parallel DBSCAN
Figure 2 for Theoretically-Efficient and Practical Parallel DBSCAN
Figure 3 for Theoretically-Efficient and Practical Parallel DBSCAN
Figure 4 for Theoretically-Efficient and Practical Parallel DBSCAN
Viaarxiv icon

Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products

Add code
Oct 28, 2019
Figure 1 for Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products
Figure 2 for Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products
Figure 3 for Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products
Figure 4 for Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products
Viaarxiv icon

Extreme Classification in Log Memory

Add code
Oct 09, 2018
Figure 1 for Extreme Classification in Log Memory
Figure 2 for Extreme Classification in Log Memory
Figure 3 for Extreme Classification in Log Memory
Viaarxiv icon