The following pages link to Hengzhao Ma (Q2180168):
Displaying 6 items.
- A true \(O(n\log{n})\) algorithm for the all-\(k\)-nearest-neighbors problem (Q2180169) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time (Q2327126) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5925661) (← links)
- Turing machines with two-level memory: new computational models for analyzing the input/output complexity (Q6185847) (← links)
