Efficient k - nearest - neighbor search algorithms for historical moving object trajectories 有效的历史移动对象轨迹的k最近邻居查找算法
Composite distance transformation for indexing and k - nearest - neighbor searching in high - dimensional spaces 基于复合距离转换的k近邻查询与索引
On the first - arrival time series of one - dimensional nearest - neighbor random walks in a space - time random environments 空间随机环境中1维紧邻随机游动首达时分布性质
In this paper , a novel - it composite distance transformation method , which is called cdt , is proposed to support a fast k - nearest - neighbor k - nn search in high - dimensional spaces 提出一种新型的基于复合距离转化的索引方法cdt composite distance transformation ,以支持快速的k近邻查询。
These values are the critical exponents of three - dimension site - lattice . we study the two - dimension triangular - bond lattice percolation with next - nearest - neighbor interactions on the renormalization group approach as well 另外,我们采用位置空间重整化群方法,对二维次近邻三角格子键渗流模型进行了研究。