Title :
Batch construction algorithm of perfectly balanced trees for solving quickly the nearest point problem
Author :
Suzuki, Hisashi ; Arimoto, Suguru
Author_Institution :
Kyushu Inst. of Technol., Fukuoka, Japan
Abstract :
This paper proposes a method of rearranging a list of keys into a binary perfectly balanced tree. Computational performances of the method are evaluated by experiments
Keywords :
list processing; search problems; tree data structures; batch construction algorithm; binary perfectly balanced tree; computational performances; list of keys; nearest point problem; Application software; Binary trees; Hamming distance; Image databases; Image restoration; Performance evaluation; Power generation;
Conference_Titel :
Singapore ICCS/ISITA '92. 'Communications on the Move'
Print_ISBN :
0-7803-0803-4
DOI :
10.1109/ICCS.1992.255097
