arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.10022cs.CG
收藏

高维深度分布

Depth Distribution in High Dimensions

Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma

摘要:

出于对数据库中范围查询的分析,我们介绍了一组$\mathcal{B}$的深度分布的计算轴对齐框,其计算推广了Klee的措施和最大深度。在最坏的情况下,在固定的输入大小$n$的情况下,我们描述了一个算法的复杂性内$O({n^\frac{d+1}{2}\log n})$,使用空间内的$O({n\log n})$,混合两种技术以前用于计算克利的措施。我们完善这个结果和以前的结果的Klee的措施和最大深度的各种措施的难度的输入,如输入的配置文件和退化的相交图形成的盒子。

英文摘要:

Motivated by the analysis of range queries in databases, we introduce the computation of the Depth Distribution of a set $\mathcal{B}$ of axis aligned boxes, whose computation generalizes that of the Klee's Measure and of the Maximum Depth. In the worst case over instances of fixed input size $n$, we describe an algorithm of complexity within $O({n^\frac{d+1}{2}\log n})$, using space within $O({n\log n})$, mixing two techniques previously used to compute the Klee's Measure. We refine this result and previous results on the Klee's Measure and the Maximum Depth for various measures of difficulty of the input, such as the profile of the input and the degeneracy of the intersection graph formed by the boxes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑