我们目前正在研究使用定制的B - Tree算法进行带有通配符的搜索并且更加紧凑地存储索引文档是否可行。

We are currently investigating whether using a customized B-Tree algorithm can make it possible to search with the help of wild CARDS and to store index documents more compactly.

youdao

本文针对这种情况，提出了一种不用经过精细分割，而是基于边缘密度计算紧凑颗粒平均尺寸的算法。

Direct against this kind of situation, the paper presents a method to estimate average size of closely packed particles based on edge density without explicit segmentation.

youdao

算法的规则性决定了对应的VLSI结构的规则性、紧凑性和视频信号处理的高速度。

The VLSI architecture is regular, and video signal processing speed is very high, because of the regularity of the proposed algorithm.

youdao