On the optimality of the hash-coding type nearest neighbour search algorithm
Computer Science and Information Technologies(2013)
摘要
The algorithmic problem of nearest neighbour search and the earlier proposed hash-coding algorithm (Elias algorithm) are considered. The problem of optimality characterization depending on the geometrical structure of blocks of the algorithm in a balanced hash-coding scheme is considered. As a supportive technique for this the structure of consecutive neighbourhood layers to the subsets of binary cube is considered. Using the known properties of isoperimetric sets it is proved that the algorithm is optimal when mentioned blocks are isoperimetric sets.
更多查看译文
关键词
file organisation,geometry,search problems,set theory,elias algorithm,algorithmic problem,balanced hash-coding scheme,binary cube subsets,consecutive neighbourhood layers,geometrical structure,hash-coding type nearest neighbour search algorithm optimality,isoperimetric set properties,optimality characterization problem,best-match,hash-coding schema,isoperimetricset,nearest neighbour search
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要