... inverse transfer locus 反传递轨迹 inversion of bit 比特反转 inversion of partitioned matrix 分块矩阵求逆 ...
基于146个网页-相关网页
If we are building an inversion list for searching only, we do not need to store the position of the last bit.
如果我们要构建一个只用于查找的倒排表，我们就不需要存储最后一比特的位置。
Inversion lists are best described as a condensed summary of a bit string.
对倒排表的最好描述是：它是对比特串的压缩表示。
There are much better compression algorithms; this is just a demonstration of how inversion lists can be applied to wider channels than a single bit string.
还可以有更好的压缩算法；这不过是为了证明倒排表可以用于比单个比特更宽的通道。
应用推荐