搜索资源列表
wangluogongchengkeshe
- 校园网络设计方案 :1、要求设计理念先进,网络结构合理,满足实际的网络组建,并具有良好的可扩展性,适当为以后网络的升级做好准备。 2、保证某些重要楼宇的链路冗余,确保网络的稳定性。(可以适当扩展比如用生成树或者动态路由协议等来实现) 3、ip地址规划合理,既要满足实际网段的需要又不能浪费ip地址,并且尽可能的保证其连续性。 4、vlan划分既可以每楼层一个vlan又要考虑特殊情况(处于不同地域的同一个单位要同属于一个vlan) 5、保证多媒体等大流量情况下带宽的需求。(可以采用链
ANTTree
- Here is the technique for modified ant Tree algorithm for MRI brain segmentatin. It is proven that it is more efficient than FCM
l
- 用二叉树实现递归遍历 希望能对大家派上用处-Achieved using a binary tree recursively traverse want to put to use for everyone
BinaryTree
- 二叉树测试,二叉树的建立,测试等等。可以进行二叉树的学习,参考。-Binary test, binary tree, build, test and so on. Binary tree can be learning, reference.
BST
- 二叉树测试操作,二叉树的建立,旋转,删除测试等等。可以进行二叉树的学习,参考。-Binary test operations, the establishment of a binary tree, rotate, delete the test and so on. Binary tree can be learning, reference.
qiang
- 数据结构二叉树实验报告,排序算法报告的详细设计-Binary tree data structure, experimental report, the report sorting algorithm
DragTree
- 利用VC++6实现TREE提供并且提供两种方式-How can Do Tree
segmentTree
- 线段树算法的详细解析.内容十分详尽.可以作为acm初学者的入门教程-Segment tree algorithm is a detailed analysis. Is thorough and comprehensive
BiTree
- 输入一个字符串,并建成一棵二叉树,满足左子树的字符都要小于根结点的字符,右字树的字符都要大于根结点的字符,每个结点值有字符和字符的出现次数,并用三种遍历方法打印,比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。-Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must be less than the root node of the
fpgrowth_doc
- FP-tree is a very fine data mining algorithm. It use FP growth algo for data mining
doublemult
- 设计了一个双精度浮点乘法器。该器件采用改进的BOO TH 算法产生部分积, 用阵列和 树的混合结构实现对部分积的相加, 同时, 还采用了快速的四舍五入算法, 以提高乘法器的性能。把 设计的乘法器分为4 级流水线, 用FPGA 进行了仿真验证, 结果正确 并对FPGA 实现的时序结果 进行了分析。-Designed a double-precision floating-point multiplier. The device uses an improved algorithm fo
cengcibianlierchashu
- C语言版的数据结构,利用层次遍历二叉树算法实现C语言的编程-C language version of the data structure, binary tree traversal algorithms using level C programming language
fenk
- 产生三维矩阵随机数列,并且能够可操作地改变各行列树值-Three-dimensional matrix of random numbers generated columns, and can be operable to change the value of the ranks of the tree
MSXML_XML
- DOM解析将会把一个完整的XML文档读进来,生成一个结构树。这样会要把XML文档全部都加载到内存中。所以解析起来的速度会要慢一些。-DOM parsing will be a complete XML document to read in, generate a tree. This will make all XML documents loaded into memory. So, speed up analysis slower.
Ctree4.5
- 详细讲解算法设计及其原理,有利于加深对决策树的理解,并能快速实现决策树的生成-calculation of the Tree c45
mobotix_sdk_1.0.1
- Mobotix Ip camera SDK. CONTENTS I. WHAT IS THE MxPEG SDK C++ LIBRARY? I.1. OVERVIEW I.2. INTENDED AUDIENCE I.3. REQUIREMENTS I.4. AVAILABLE DISTRIBUTIONS I.5. LICENSING CONSIDERATIONS II. WHAT HAS CHANGED SINCE v0.9.1 III
200905112
- 一种基于Super Peer结构的P2P视频点播系统的设计与实现摘 要 分析各种P 2 P网络的特点, 为了使用户在视频点播过程中获得快速、 稳定的流媒体数据, 提 出了一种采用 S u p e r P e e r 结构的 P 2 P视频点播设计方案。讨论 了以该方案为基础的拓扑树的构建、 拓扑树的变更等关键技术, 并对该系统进行了性能 分析, 证明其具有较好的可靠性和稳定性。-Based on the structure of Super Peer P2P VOD System D
shujujiegou
- 主要介绍数据结构,是对c语言学习的加强,主要介绍了排序,线性表,队列,数组,广义表,书和二叉树,查找,图等类容。-Introduces the data structure is the c language to enhance learning, introduces the sort, linear tables, queues, arrays, generalized table, books and binary tree, locate, map, and the like capa
hyde5
- Note that a steiner tree might contain the steiner vertices. The length of a steiner tree is defined to be the sum of the lengths of all its edges
RandomizedTrees
- 随机树算法进行配准的非常经典的算法和非常经典的论文-random tree