Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
While they do a great job when working with regular data types, they are not very efficient when dealing with binary data, for example images or documents.
数据库处理规范数据类型十分在行，但是在处理如图像、文档等二进制数据时却不是那么得心应手。
So the fitting effect of MIVM is better than that of the regular solution model in binary solid alloys.
分子相互作用体积模型在二元固态合金中的活度拟合效果优于正规溶液模型。
GetCell: get a value out of a cell. The two regular addressing flavors exist. You can either get formatted string values, or the raw binary values.
获取某单元格位置值。有两种常用的寻址方式，获取格式字符串值或原二进制值。
It can search both text and binary files using either ordinary text or GREP-like regular expressions, based on the standard UNIX search utility.
它可以搜索文本和二进制文件使用普通的文本或grep一样的正则表达式的基础上，标准的Unix搜索工具。
A novel and simple construction of regular LDPC codes was proposed, which used sparse binary sequences, through studying construction methods of LDPC codes.
通过对低密度奇偶校验(LDPC)码构造的研究，提出了一种利用稀疏二进制序列构造规则LDPC码的新颖而简单的方法。
The molecular interaction volume model(MIVM) and the regular solution model have been applied to fit the activities of components in 37 binary solid alloys.
应用分子相互作用体积模型和正规溶液模型对37个二元固态合金体系的组元活度进行了拟合。
The applicability in using thermodynamic methods to treat XRF data has been studied in detail, The work proved that the sub-regular solution model (SRSM) can be applied to binary system.
本文探讨了用热力学方法处理XRF数据的可行性，认为用亚正规溶液模型处理二元系是可行的。
Powerful index search engine and a proper full-feature regular expression engine for binary searches.
强大的搜索引擎索引和适当的全功能的二进制搜索正则表达式引擎。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
应用推荐