| Experiments with a closest point algorithm in Hamming space | |
| Authors: | O. Nevalainen and J. Katajainen |
| Published in: | Angewandte Informatik 24,5 (1982), 277-281 |
| Full text: |  PDF (1.48 MB) |
| Copyright: | © Friedr. Vieweg & Sohn Verlagsgesellschaft mbH |
| Abstract: | A search tree structure originally introduced by Burkhard and Keller (Some Approaches to Best-Match File Searching, CACM Vol. 16, p. 230) is studied experimentally. The best-match searching time depends on the final minimal distance between the search point and the points in the search tree. Some modifications aiming at better performance are also proposed. For the purpose of comparison some tests with the well-known k-d tree are performed. |
| Related: |  HTML (Thesis) |
| BibLATEX: | @article{NK1982J,
author = {O. Nevalainen and J. Katajainen},
title = {Experiments with a closest point algorithm in {H}amming space},
journaltitle = {Angewandte Informatik},
volume = {24},
number = {5},
year = {1982},
pages = {277--281},
}
|