A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems (Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Let U denote a set comprising elements called "keys." The goal of the nearest point problem is to search quickly for a key x among some keys x_1,…,x_n that is the nearest to a reference key x under a partial order relation ⪯ defined as (x,y)⪯(x,z) for x,y,z⋳U if d(x,y)≦d(x,z) given a wide-sense distance measure d. This article proposes a method of rearranging x_1,…,x_n into a binary perfectly-balanced tree for solving quickly the nearest point problems. Further, computational performances of the proposed method are evaluated experimentally.

• 社団法人電子情報通信学会の論文
• 1993-09-25

著者

• Arimoto Suguru

  The Faculty Of Engineering The University Of Tokyo

• Suzuki Hisashi

  the Faculty of Science and Engineering, Chuo University

• Suzuki Hisashi

  The Faculty Of Science And Engineering Chuo University

関連論文

• Asymptotic Optimality of Modified Spherical Codes with Scalar Quantization of Gain for Memoryless Gaussian Sources (Special Section on Information Theory and Its Applications)
• A Method of Managing Perfectly-Balanced Trees for Solving Quickly the Nearest Point Problems (Special Section on Information Theory and Its Applications)

スポンサーリンク