二维四叉树中的部分匹配查询:一种概率方法
Partial Match Queries in Two-Dimensional Quadtrees : a Probabilistic Approach
摘要:
我们分析了随机二维四叉树中部分匹配查询的平均代价。该方法是基于碎裂理论。收敛性由马尔可夫链的耦合变元来保证,而极限的值被计算为积分方程的不动点。
英文摘要:
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov chains, whereas the value of the limit is computed as the fixed point of an integral equation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。