Frequent item mining algorithms need to perform as little data stream scanning as possible while using limited size of memory.
数据流频繁项挖掘算法需要利用有限的内存，以尽量少的次数扫描数据流就能得到频繁项。
It also details in concrete terms the composition of the three tokens (a plus sign, a minus sign, and an integer) that the parser expects to encounter while scanning through the input stream.
它还详细描述了三个记号(加号、减号和整数)组合的具体项，解析器在扫描整个输入流时希望遇到这些项。
While minimizing the use of clock cycles, it could decode the coded stream of transform coefficients in each block and output the decoded coefficients in zigzag scanning order.
在尽量减少时钟消耗的前提下，此解码器可以解码每个变换块中变换系数的熵编码码流，并将结果按照块扫描顺序并行输出。
The region segmentation is arranged on the down stream side of the scanning position, and the region segmentation has a low which is lower than the upper surface of the transparent platform;
区段，所述区段位于所述扫描位置的下游侧，并具有低点，所述低点低于所述透明平台的上表面；
The region segmentation is arranged on the down stream side of the scanning position, and the region segmentation has a low which is lower than the upper surface of the transparent platform;
区段，所述区段位于所述扫描位置的下游侧，并具有低点，所述低点低于所述透明平台的上表面；
应用推荐