An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Hi-index | 0.10 |
Test results of three adaptive partition strategies for constructing multidimensional ternary trees are presented. Such trees can be used to efficiently identify correlated measurements with error bounds that can be represented as finite volumes.