1) k-bisimilarity
k阶双似
2) k approximate
k近似
1.
It is given an optimal algorithm for problem ① and we prove that the algorithm is k approximate algorithm for problem ②.
给出了问题①的一个最优算法,同时应用该算法,问题②是k近似的。
3) k Voronoi diagrams
k阶Voronoi图
1.
This paper presents an efficient method to process continuous k nearest neighbor in road network based on k Voronoi diagrams.
现提出了道路网络中基于k阶Voronoi图的连续k近邻查询方法,该查询方法用分枝限界的思想动态地创建局部Voronoi图,降低了查询代价。
4) k orders generation
k阶生成
1.
This paper also gives the k orders generation concepts of [α/R] knowledge- [R]knowledge, puts forward the k orders generation dependency theorems and the principle of k orders generation dependence con.
本文给出[α/R]知识 [R]知识k阶生成概念,提出k阶生成依赖性定理,k阶生成依赖一致性原
5) k orders dependence
k阶依赖
6) touch at k range
k阶切触
补充资料:意意似似
1.见"意意思思"。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条