您要查找的是不是:
- It keeps the same data structure as a news item. 其数据结构与新闻项一样。
- The option value data structure is not valid. 选项值数据结构无效。
- Check that the data structure is self-consistent. 检查引用合法性。
- The Delphi Data Structure Generic Class Library. 范型数据结构类库
- Not initialize Disk Array data structure! 没有初始化磁盘阵列!
- Keywords: native XML database, data structure. 关键词:原生型XML资料库、资料结构。
- The data structure is a User_URL matrix. 数据结构是一个用户/页面(User_URL)关联矩阵,用来表示用户对页面的访问信息。
- Good at Data Structure and Arithmetic Design. 数据结构及算法设计知识扎实。
- Having Designed an extrude intake algorithm for the half edge graph partitioning problem, this algorithm can solve machine redundant manufacturing cell design problem. 设计了针对半边图划分问题的半边图挤出吸入算法,用此算法求解了机器可选制造单元成组设计问题。
- Multi-way half edge graph partitioning problem with redundant plan paths is the complex combination optimizm problem that has various constraint. 计划路径可选的半边图划分问题是一类含有多种局部约束的复杂组合优化问题。
- A description of the IRP data structure can be found here. 你可以在这里找到IRP数据包一种描述。
- Finally,the edge data of the particles was processed smoothly applying geometry theory.The experiment results show that the method can segment urina... 实验结果表明,该方法在尿沉渣图像分割的应用中得到了令人满意的结果。
- The paper presents a distance combination scheme based on HSI (hue, saturation and intensity) so as to capture more accurate edge data in RGB color field. 为了在RGB3维彩色场中获取精确的边缘信息,提出了一种基于HIS(色度、饱和度和亮度)的距离联合边缘检测方法。
- This paper analyzes the main data structure of NTFS. 文章分析了NTFS文件系统的主要数据结构。
- The probably solution of complex combination optimizm problem can describe by half edge graphs,designed a extrude intake algorithm for graph,this algorithm can solve manufacturing cell design problem. 用半边图来描述复杂组合优化问题的可能解,在此基础上设计了针对图的挤出吸入算法,用此算法求解了一个典型的复杂组合优化问题,制造单元设计问题。
- Long string and data structure up to 2 gigabyte in size. 最长达 2 吉字节的长字符串和数据结构。
- Long string and data structure up to2 gigabyte in size. 最长达2吉字节的长字符串和数据结构。
- An octree is actually nothing more then a data structure. 一个八叉树实际上就是一个数据结构。
- This tutorial also makes use of the STL deque data structure. 该例子同样使用STL 中的queue数据结构。
- Trie is an ordered tree data structure that uses strings as keys. Introduction介绍Trie,又称单词查找树,是一种树形结构,用于保存大量的字符串。