Hengzhao Ma

activity

20182023

most citedAn Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time

5 citations · 8 across the 8 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2020★ 1 cited

A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee

Hengzhao Ma, Jianzhong Li

In this paper we propose an algorithm for the approximate k-Nearest-Neighbors problem. According to the existing researches, there are two kinds of approximation criterion. One is…

cs.CG2019★ 2 cited

A True $O (n lo g n)$ Algorithm for the All-k-Nearest-Neighbors Problem

Hengzhao Ma, Jianzhong Li

In this paper we examined an algorithm for the All-k-Nearest-Neighbor problem proposed in 1980s, which was claimed to have an $O (n lo g n)$ upper bound on the running time. We find…

A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee

A True O(nlogn) Algorithm for the All-k-Nearest-Neighbors Problem

A True $O (n lo g n)$ Algorithm for the All-k-Nearest-Neighbors Problem