搜索资源列表
clk-realview
- Implementation of the ARM RealView clock trees.
inftrees
- inftrees.c generate Huffman trees for efficient decoding. -inftrees.c generate Huffman trees for efficient decoding.
ibxtrees
- IBX Trees for delphi
huofuman
- 给定n个权值作为n的叶子结点,构造一棵二叉树,若带权路径长度达到最小,称这样的二叉树为最优二叉树,也称为哈夫曼树(Huffman tree)。哈夫曼树是带权路径长度最短的树,权值较大的结点离根较近。-Given n weights as a leaf node n, and construct a binary tree, if the weighted path length to a minimum, said such a binary tree is optimal binary tre
M0203
- Power Architecture CPUs in Freescale SOCs are represented in device trees as per the definition in ePAPR.
Kruskal-Algorithm
- Kruskal s algorithm is a minimum-spanning-tree algorithm where the algorithm finds an edge of the least possible weight that connects any two trees in the forest
decision-tree
- 使用matlab建立决策树,分析数据。决策过程中使用了matlab自带的建立决策树的函数。-Using decision trees to predict contact lens type.Training data file (lense.txt) and descr iption file (comments.txt).
sram
- trees.c output deflated data using Huffman coding. -trees.c output deflated data using Huffman coding.
libiary
- 图书管理基本业务活动包括:对一本书的采编入库、清除库存、借阅和归还等等。试设 计一个图书管理系统,将上述业务活动借助于计算机系统完成。 要求: (1)每种书的登记内容至少包括书号、书名、著者、现存量和总库存量等五项。 (2)作为演示系统,不必使用文件,全部数据可以都在内存存放。要用 B-树(4 阶树) 对书号建立索引,以获得高效率。 (3)系统应有以下功能: 采编入库、清除库存、借阅、归还、显示(以凹入表的形式显示)等。-Library management basic business
c4.5-java
- this files contains source code of c4.5 decisions trees
sgu250
- sgu250:Constructive Plan 题目大意: 给出一个n∗ m的01矩阵,0表示不能放,1表示能放,在其中放入三个矩形,要求满足如下条件: 1.每个矩形面积大于0。 2.这些矩形必须是一个联通块,矩形之间不能重叠。 3.矩形的左边界在同一条线上。 4.中间矩形的横向长度小于两边矩形的横向长度。 求出最大的三个矩形的总面积,无解输出− 1。-250. Constructive Plan time li
keyctl
- Search the process keyrings and keyring trees linked those for a matching key. Keyrings must have appropriate Search permission to be searched. -Search the process keyrings and keyring trees linked those for a matching key. Keyrings must have appr
RandomForest_matlab
- 随机森林是一个包含多个决策树的分类器, 并且其输出的类别是由个别树输出的类别的众数而定-Random Forest is a decision tree classifier comprising a plurality, and its output is the category number by individual trees all output categories may be
bbtree
- 平衡二叉树包括建立添加删除遍历,控制台程序,主要演示平衡二叉树的实现-Balanced Binary Tree This article give a brief, non-academic (=no dwelling into time complexity issues), explanation of what binary trees are about. It also provide source and demo of a generic tree class. Functio
DecisionForest_v3.1
- [1] Quan Wang, Yan Ou, A. Agung Julius, Kim L. Boyer and Min Jun Kim, Tracking Tetrahymena Pyriformis Cells using Decision Trees , 2012 21st International Conference on Pattern Recognition (ICPR), Pages 1843-1847, 11-15 Nov. 2012. [2] Q
diagona2-(1)
- le code d un algoghithme pour les spanning trees
pack2
- 1.粒子系统实现喷泉; 2.喷泉的水面,采用的是模仿水波的网格,当水滴滴到水面的时候,会在那个点产生一个很低的点,然后向四周的点扩散,形成一高一地的波形。 3.三维草丛和树木为3DS模型; 4.天空是采用天空包围盒,6个面包围在视角的外面,然后贴上图片(连续的内容的图片),看起来很像天空 改变天空明亮度,设置灯光的颜色,如果天空很暗,那么就改变值使变亮, 如果太亮,就使变暗,来回循环-1. The particle system fountain 2. The surf
JAVA
- 高度平衡性检查 给定一个整数树,检查它是否高度平衡,返回一个布尔值。 搜索树属性的测试 给定一个整数树,写一个方法,返回一个布尔值,表示是否是一个二进制搜索树。 高度平衡插入 为二进制搜索树编写修改版本的插入方法,以便它保持树的高度平衡性。你应该假定输入树是高度平衡的,并产生一个高度平衡的树。 该方法应在(日志)时间内工作。 你可以使用issearchtree和isheightbalanced方法Assert语句来验证您的代码是正确的。 高度平衡删除 为二进制
ftw
- inftrees.c generate Huffman trees for efficient decoding.Build a set of tables to decode the provided canonical Huffman code. -inftrees.c generate Huffman trees for efficient decoding.Build a set of tables to decode the provided canonical Huffman
datedata
- output deflated data using Huffman coding.The deflation process uses several Huffman trees. The more common source values are represented by shorter bit sequences. -output deflated data using Huffman coding.The deflation process uses several Huff