Title :
An asymptotic evaluation on the number of computation steps required for the nearest point search over a binary tree
Author :
Suzuki, Hisashi ; Arimoto, Suguru
Author_Institution :
Dept. of Inf. & Syst. Eng., Central Univ., Tokyo, Japan
Abstract :
This paper analyzes the number of computation steps on a binary tree searching fast for one in some beforehand-given points (binary sequences) that is the nearest to a query point in a Hamming space
Keywords :
binary sequences; calculation; tree searching; Hamming space; asymptotic evaluation; binary sequences; binary tree; computation steps; nearest point search; Binary sequences; Binary trees; Hamming distance; Physics computing; Zirconium;
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
DOI :
10.1109/ISIT.1995.531158
