computing complexity中文是什么意思

• 计算复杂性

• compute    vt.,vi. 计算，估计；算定。 compute ta ...
• complexity    n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情 ...
• complexity of computing    计算复杂性
• complexity    n. 1.复杂性，复合状态。 2.复合物；复杂的事物[情况]。
• computing    电脑运算; 计算的估计的; 计算机系; 计算机信息处理技术
• advancing complexity    进化综合
• algorithm complexity    算法复杂性
• algorithmic complexity    算法复杂性
• asymptotic complexity    渐近复杂性
• aufwand complexity    复杂性
• business complexity    业务复杂性
• chemical complexity    化学复杂度
• circuit complexity    电路复杂性
• clonal complexity    克隆复杂性
• code complexity    代码复杂性
• cognitive complexity    认知复杂性
• complexity analysis    成分分析
• complexity class    复杂度类; 复杂性类
• complexity factor    复杂度系数; 复杂性因子; 复杂性指示; 复杂因数
• complexity graph    复杂性图形
• complexity measure    复杂性度量
• complexity metrics    复杂性度量
• complexity of computation    计算的复杂性; 计算复杂性
• complexity of emotion    情绪的复杂性
• complexity of interface    接口复杂性

• Not only we analyze these architectures ’ efficiency and computing complexity , but also complete the 8 - band parallel processing receiver ’ s computer simulation and fpga realization to testify the architectures are correct and hardware realizable
  从结构有效性和运算复杂度对各种模型进行分析和比较,并通过8信道并行处理接收机的matlab仿真和fpga实现验证了模型的正确性和可实现性。
• Experimental results show the hidden information capacity of this algorithm is one time more than lsb algorithm , and much more than all kinds of transform domain algorithms , but computing complexity is much lower than transform domain
  实验表明在不影响图像视觉效果的前提下，其信息隐藏量比lsb算法大一倍以上，比各种变换域算法的信息隐藏量更是大很多，而计算复杂度比变换域算法低很多。
• ( 3 ) it is well known that the determinant problem in classic proposition logic is a np complete problem , and the first order logic is a half determinant one . so both the analysis of computing complexity and the realization of it are the most important fields
  ( 3 )众所周知，经典命题逻辑中的判定问题是np完全问题，而一阶逻辑是半可判定问题，关于非经典逻辑特别是非单调逻辑的计算复杂性分析和算法实现是一个重要的研究领域。
• Because of the rapid increasingly computing complexity and the explosive growth of information , the traditional centralized computing patterns are not adequate for large - scale distributed information processing , but agent - based computing and high - level interaction may satisfy the modern computing and distributed information processing , and multi - agent system ( mas ) can play an important role in analyzing and developing the model and theory of human - interaction
  随着现代计算复杂性和信息量的急剧增长，传统的集中计算模式已不能适应大型分布式信息处理的发展。而基于agent的计算和以agent为主体的高层交互可以满足现代计算和分布式信息处理系统的要求，而且多agent系统在分析和建立人类交互模型和交互理论中可以发挥重要作用。
• The comparable results of the barnard - log algorithm show that it has good tolerance of the illumination and contrast . based on this feature extraction , a stereo matching algorithm is implemented to support its efficacy . ( 3 ) to reduce the computing complexity of the cross correlation in the area based stereo matching , an increment based optimized algorithm for ssd and cross correlation algorithm is proposed
  然后将该barnard - log特征应用到一种特征匹配算法,并通过实验说明所改进的barnard - log特征算法在图像匹配中具有比较好的适用性; ( 3 )针对区域匹配中应用图像互相关算法和ssd算法计算复杂度较高的问题,分别为图像互相关算法和ssd ( sumofsquaredifference )算法引入增量方法的思想来降低计算复杂度。
• A relation between packet loss rate and times of simulating decoding in encoder was setup in proposed algorithm for the first time . using this relation , encoder could adaptively determine the times of simulating decoding according packet loss rate and the number of simulating channel states . so the computing complexity and coding time in encoder was decreased effectively
  该算法首次在当前信道丢包率与编码器端进行仿真解码的次数之间建立起了一种对应关系，根据此对应关系编码器端可根据当前信道丢包率信息以及模拟随机信道状态的个数来自适应地决定进行仿真解码的次数，从而有效降低编码器端的计算量和编码耗时。
• Based on knowledge reasoning , fuzzy theory , extraction of sub - assembly and cluster , and hierarchical connection relation graph , an assembly sequence generation algorithm is studied in this paper , which breaks down the original complex assembly sequence generation problem into several small scale assembly sequence planning problems to reduce the computing complexity caused by cut - set theory . a hierarchical and / or graph to store all the generated sequences is also employed for this purpose
  本文提出基于知识推理及模糊理论，结合子装配与聚族提取以及装配树，利用层次联接关系图，将一个复杂的装配序列求解问题转化为若干个相关的小规模装配序列求解问题，并用一种层次与或图结构存储装配序列，使割集法求解装配序列的计算复杂度大大降低。
• By introduce new video coding technologies , avs and h . 264 gain a wonderful coding efficiency . the computing complexity also increases for 2 - 3 times than mpeg - 2 because of the complexity of the algorithm . that means the performance of software decoding can not achieve a high level , especially the real - time high - definition decoding
  同时avs和h . 264等高级视频编码标准采用了大量最新的视频编码技术,获得了很好的效果,但是其压缩效率的提高也是以压缩算法复杂度的提高为代价的,其解码复杂度大约是mpeg - 2的2 - 3倍,这造成了单纯用软件解码难以达到很高的性能,特别是对于实时应用,对于高清晰度视频不能实现实时解码,这样就需要硬件加速或者设计专门的硬件解码电路。
• Follow aspects are discussed in this thesis and effective solutions are proposed . architecture of video decoding soc the computing complexity of video decoding is analyzed in this thesis and a reasonable and feasible scheme is proposed . a hardware module partitioning also be proposed based on the comparison of different method
  本文针对以下几个问题作了详细研究,并提出了有效的解决方案:视频解码soc结构设计本文分析了视频解码的计算复杂度,进行了合理可行的软硬件划分,并在比较不同方案的基础上,进行了合理的硬件模块划分。
• In order to reduce the computing complexity and the needed data storage , some fast algorithm of the decoding flow are studied , the idct module in the synthesizer subband filters is discussed detailed . a algorithm of idct implement on the fixed - point dsp chip is given
  论文最后对解码流程呻的大运算量模块进行了研究，重点针对子带综合滤波器中的idct运算进行改进，提出一种基于定点dsp的快速算法，降低了程序的计算量和数据存储量，并在定点数字信号处理芯片上得到实现。