Journals
Conferences
- Keito Kido, Daichi Amagata, and Takahiro Hara.
Fast Approximation Algorithm for Euclidean Minimum Spanning Tree Building in High Dimensions
Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pages xxx-xxx, 2025.
Special Session: Data Science: Foundations and Applications (DSFA)
Code is here.
- Daichi Amagata
Random Sampling over Spatial Range Joins
Proceedings of the IEEE International Conference on Data Engineering (ICDE), pages xxx–xxx, 2025.
Code is here.