助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   空间复杂性 的翻译结果: 查询用时:0.035秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
地理
宏观经济管理与可持续发展
数学
自然地理学和测绘学
船舶工业
教育理论与教育管理
经济理论及经济思想史
社会学及统计学
更多类别查询

图标索引 历史查询
 

空间复杂性
相关语句
  spatial complexity
     Since a bottom-to-top merging approach is adopt-ed,the time and spatial complexity of the algorithm is O(N).
     又因为采用了由底至上的合并方案,使该算法有良好的时间和空间复杂性O(N)。
短句来源
     CELLULAR AUTOMATA AND SIMULATION OF SPATIAL COMPLEXITY OF URBAN SYSTEMS:HISTORY,PRESENT SITUATION AND FUTURE
     细胞自动机与城市系统的空间复杂性模拟:历史、现状与前景
短句来源
     Studies on Spatial Complexity of Fractal Urban Systems
     分形城市系统的空间复杂性研究
短句来源
     Cities, Fractals and Spatial Complexity
     城市、分形与空间复杂性探索
短句来源
     According to the difficulties meeting with performing the initialization of spatial data based on vector data: the complexity in spatial data expressing and the huge cost of storage and operation, not fit for the need of continuous dynamic geographical analysis, spatial complexity theory is given as a whole in GIS spatial analysis.
     提出了空间衍生数据显式初始化带来的运算、存贮开销,以及对复杂、动态、连续地理过程的分析处理的不适应性,从整体上提出了当前GIS的空间分析存在的空间复杂性理论问题。
短句来源
更多       
  space complexity
     For any given problem with A(1),A(2),…,A(n-1),A(n),and M, the time complexity of the algorithm is O(n~~(log_2(M+1)+1))and the space complexity is O(n), where A(1),A(2),…,A(n-1),A(n),and M are all positive integers.
     设给定的n个正整数为A(1),A(2),…,A(n-1),A(n),给定的子集和为正整数M,算法的时间复杂性为O(nlog2(M+1)+1),空间复杂性为O(n)。
短句来源
     The space complexity of the new algorithm is O(1).
     新算法的空间复杂性是 O(1)。
短句来源
     Its time complexity is O (n2) and space complexity is O(n).
     它的时间复杂性是O(n~2),空间复杂性是O(n)。
短句来源
     The algorithm has acceptable time complexity O(N3) and space complexity O(N), and it could be used to compress and transmit any size of images.
     该算法还有良好的时间复杂性O(N3)和空间复杂性O(N) ,可用于任意大小图像的压缩与传输。
短句来源
     It is concluded that for the algorithm the multiplication com-plexity is O(N log~2 N),the addition complexity O(N~2) and the space complexity O(N~2).
     空间复杂性为O(N~2)。 本文还探讨了该算法的几个实际问题及适用范围。
短句来源
更多       
  “空间复杂性”译为未确定词的双语例句
     Vertex coloring algorithm is a polynomial time approximate one which is obtained by using the greedy tactics.
     顶点染色算法是一个多项式时间的近似算法,该算法的时间复杂性为O(n~3logn),空间复杂性为O(n~3)的近似算法,它是由贪吃策略得到的.
短句来源
     This paper improves V. Strassen' s fast matrix multiplication algorithm, reducing its storage complexity from O(N2.81) to 4N2, and discuses about realization of improved algorithm.
     本文改进了V.Strassen矩阵快乘算法,在时间复杂性保持相同,但将其空间复杂性从ON~(2.81)降至4N~2。 文中还给出了改进算法的实现技术。
短句来源
     Usually, in underground geotechnical engineering two-dimensional analysis is adopted, not three dimensional, because of the special complexity of the caves, the nonlinear material and the nonlinear excavation process.
     在地下岩土工程中往往由于洞室群的空间复杂性、岩体材料的非线性以及开挖过程的非线性使得对工程的分析变得十分复杂,所以许多工程分析中常采用二维问题来求解。
短句来源
     This paper evaiuates the time complexity of a hashing join method and traditional join
     本文对用于统计数据库的散列连接法和传统连接法的时间复杂性进行了评估,并简单地讨论了扩展散列法的空间复杂性
短句来源
     The complexity of the algorithm is proportional to the face number of the object.
     算法的时间和空间复杂性都是和组成形体的面数成线性关系的。
短句来源
更多       
查询“空间复杂性”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  spatial complexity
Thus, the fractal dimension serves as a numerical measure of the spatial complexity of the neuron and correlates with the morphofunctional organization of the cell.
      
As the applied thermal gradient is increased, a cascade of symmetry breakings occurs, towards structures of increasing spatial complexity, and ultimately towards oscillating states.
      
The discovery of urban locality is significant to improve the cellular-automata-based urban simulation of modeling spatial complexity.
      
By providing a niche for species not normally found in undisturbed prairie, carcasses increased community heterogeneity and may play an important role in adding spatial complexity to grassland ecosytems.
      
Habitat overlap of enemies: temporal patterns and the role of spatial complexity
      
更多          
  space complexity
Time and space complexity bounds related to the parameters of the problem are derived.
      
The estimates of the time and space complexity are related to the parameters of the problem.
      
The estimates of the time and space complexity are related to the parameters of the problem.
      
Estimates for the time and space complexity of the algorithm as a function of problem parameters are given.
      
Furthermore, since one network is decomposed into two smaller subnetworks, the computing time complexity and space complexity can be reduced.
      
更多          
  spatial complex
High-level visual-spatial ability for novices correlates with performance in a visual-spatial complex surgical simulator task
      
The construction technique is a time generalization of the frequently used spatial complex ray method.
      
We define mechanisms of the creep process in spatial complex-shaped bodies.
      
At the end of this construction, each leaf of the tree represents a cell in the spatial complex.
      
Studying Geo-Spatial complex systems has been regarded as a promising tool.
      


In this paper a new theoretic model of automatic fault diagnosis for the digital systems is proposed, in which the set of test outcomes tallies with the modulo-two operation. The necessary and sufficient conditions of fault syndrome in this model have been discussed. It has been proved that any digital system which is suited to modulo-two model has the one-step fault diagnosability, if the number of fault units is less than the half of total units. It is shown that Determing the most likely consistent fault...

In this paper a new theoretic model of automatic fault diagnosis for the digital systems is proposed, in which the set of test outcomes tallies with the modulo-two operation. The necessary and sufficient conditions of fault syndrome in this model have been discussed. It has been proved that any digital system which is suited to modulo-two model has the one-step fault diagnosability, if the number of fault units is less than the half of total units. It is shown that Determing the most likely consistent fault sets is equivalent to solving a modulo-two linear programming problem. Based on this analysis, the author has gotten an effective method and its APL program for correctly ditect consistent fault sets, and proved that the space-time complexity of this algorithm is linear. Finaly, this model has been extended to probabilistic fault diagnosis. In fact, there are some advantages in modulo-two model over the others.

本文提出了数字系统故障自动诊断的一个新的理论模型,此模型中的测试记录符合模2运算。文中讨论了模2模型故障症候的充分和必要条件,证明了任何适合此模型的系统都是在故障单元少于半数情况下一步故障可诊断的。进而指出,确定最大可能相容故障集与解模2线性规划问题是等价的。在此基础上,给出了一个求相容故障集的有效算法以及它的APL程序,并且论证了此算法的时间和空间的复杂性都是线性的。最后,将此模型推广到了随机故障诊断。事实表明此模型与其它模型相比有较多的优点。

In this paper a new algorithm for computing longest common subsequences of two given sequences (or strings) is presented, by which the problem is solved in running time of 0(n)-O(n2) and in storage space of O(n), where n is the length of sequences. Running time depends upon the distribution of characters (or symbols) on the sequences. This algorithm is the first to make parallel processing of the LCS possible, and it is suitable for VLSI technology, as its hardware realization is quite easy. On the other hand,...

In this paper a new algorithm for computing longest common subsequences of two given sequences (or strings) is presented, by which the problem is solved in running time of 0(n)-O(n2) and in storage space of O(n), where n is the length of sequences. Running time depends upon the distribution of characters (or symbols) on the sequences. This algorithm is the first to make parallel processing of the LCS possible, and it is suitable for VLSI technology, as its hardware realization is quite easy. On the other hand, the best running time of the algorithms by other authors for finding the LCS has a relation to O(nlog n)-O(n2 log n), while the storage space bears generally a relation to O(n2). All of them do not take into account of the distribution of characters and they can not perform the parallel process. Thus the average performance of the algorithm in this paper is much better than that of other algorithms.The theorem and the proof of correctness related to the new algorithm is also briefly stated. For an application to the pattern recognition, a discussion is made on its extension to the weighted longest common subsequences and to the longest common sub-matrix.

求解LCS(Longest Common Subsequences)的通常算法,空间和时间的复杂性为O(n~2)。本文中提出的算法,空间复杂性为O(n),时间复杂性为O(n)~O(n~2),时间复杂性取决于序列中符号的分布,本算法便于并行处理及制成微处理器。 为了应用于模式识别,推广到WLCS(Weighted Longest Common Subsequences)以及LCSM(Longest Common Submatrix)。 给出了有关的定理,及算法正确性的证明。

This paper discusses the general significance of the ∑LU decomposition method ofmatrices.And it is considered that only on the basis of actual realization of fast algori-thms can the decomposition theory above have real significance.In the paper,the newalgorithm described in the references is expounded and some complementation andcorrection are given.A detailed analysis of the algorithm steps and the complexity ofthe algorithm is made.It is concluded that for the algorithm the multiplication com-plexity is O(N...

This paper discusses the general significance of the ∑LU decomposition method ofmatrices.And it is considered that only on the basis of actual realization of fast algori-thms can the decomposition theory above have real significance.In the paper,the newalgorithm described in the references is expounded and some complementation andcorrection are given.A detailed analysis of the algorithm steps and the complexity ofthe algorithm is made.It is concluded that for the algorithm the multiplication com-plexity is O(N log~2 N),the addition complexity O(N~2) and the space complexity O(N~2).Several real problems and the rational scope of the algorithm usage are also explored.

本文根据文献讨论了矩阵∑LU 分解法的普遍意义,详细分析了文献提出的新算法的步骤及算法的复杂性,并对它们作了补充和订正。本文指出,新算法的乘法复杂性为O(N log~2 N);加法复杂性为O(N~2);空间复杂性为O(N~2)。本文还探讨了该算法的几个实际问题及适用范围。算法已在HP-3000计算机上用PASOAL 语言程序实现。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关空间复杂性的内容
在知识搜索中查有关空间复杂性的内容
在数字搜索中查有关空间复杂性的内容
在概念知识元中查有关空间复杂性的内容
在学术趋势中查有关空间复杂性的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社