搜索资源列表
肖天华数据结构大作业
- 本次作业采用MFC多文档——视图结构体系（已征得肖老师的同意）。开发环境为VC++ 6.0 SP6，其他环境下编译未做测试。 程序运行时的外观如上图所示：文档窗口被分割为左右两部分。左边部分采用树形控件CTreeCtrl管理，右边部分采用文本框控件CEdit管理。打开或生成的XML文档都将以文本方式显示在右侧文本编辑窗口，经一定算法解析后将在左侧窗口中按XML文档描述的逻辑结构以树形目录的方式显示出来，直观明了。 -this operation using MFC more docume
Dual_tree_complex_wavelet_transform
- 这是一篇介绍二分树复数小波的文章，里面很详细的介绍了Dual tree complex wavelet transform。希望大家有帮助-two hours on the tree Complex Wavelet article there is a detailed introduction to the Dual tree complex wavelet transform . We hope help
FACE_DETECTION_USING_DT-CWT_ON_SPECTRAL_HISTOGRAM.
- 这是一篇应用二分树复数小波检测人脸的一篇文章，希望与对二分树复数小波感兴趣的人一同切磋-This is the application of two hours a tree Complex Wavelet Face Detection of an article, with the hope that the two sub-tree Complex Wavelet interested in the interaction together
Pattern_recognition_with_SVM_and_dual-tree_complex
- 这是一篇应用二分树复数小波与SVM进行模式识别的一篇文章，希望与对二分树复数小波感兴趣的人一同切磋-This is the application of two hours a tree Complex Wavelet and SVM pattern recognition for an article, with the hope that the two sub-tree Complex Wavelet interested in the interaction together
a_method_of_watermark_by_Dual_tree_complex_wavelet
- 这是一篇应用二分树复数小波进行数字水印的一篇文章，希望与对二分树复数小波感兴趣的人一同切磋-This is the application of two hours a tree Complex Wavelet digital watermark an article, with the hope that the two sub-tree Complex Wavelet interested in the interaction together
Palmprint_Classification_using_Dual-Tree_Complex_W
- 这是一篇应用二分树复数小波进行掌纹分类的文章，希望与共同致力于复数小波的同仁分享-This is an application of two-tree complex wavelet palmprint classification of the article, hope and work together Complex Wavelet colleagues share
shujujiegou-erchashu
- 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and
源代码（vc++）
- 里面装有 5 个小程序，分别是：0-1背包问题、二叉树遍历、链式表的实现、迷宫路径、资源最优配置算法。每个程序都有详细的说明，是我这两个学期所做的实验的一部分。-containing five small programs, namely : 0-2-1 knapsack problem, the binary tree traversal and the chain table and that the realization of the maze path, the optimal res
HnSRTree-1.3.1.tar
- R 树， 存取方式的当中最普遍的的用长方形， 是根据区域的启发式优化围绕的长方形在各个内在结点通过运行在一张规范化的试验平台下高度变化的数据， 询问和操作众多的实验， 我们能设计合并联合的优化的R* 树区域， 各个附寄的长方形边际和交叠在目录使用我们规范化的试验床在详尽表现比较，它结果R* 树清楚地胜过现有的R 树变形Guttman’s线性和二次方R 树和R 树的格林变形，R* 树的这优势举行为不同的型询问和操作， 譬如地图覆盖物。 为两个长方形和多维点在所有实验从一个实用观点R* 树是非常有吸
mcl
- 详细介绍MCL算法，是由Sebastian Thrun a, Dieter Fox, Wolfram Burgard, Frank Dellaert所著的论文，发表于Artificial Intelligence上。-Mobile robot localization is the problem of determining a robot’s pose from sensor data. This article presents a family of probabilistic lo
main
- If a tree falls in the forest, and there s nobody there to hear, does it make a sound? This classic conundrum was coined by George Berkeley (1685-1753), the Bishop and influential Irish philosopher whose primary philosophical achievement is the advan
ch06
- 我們的注意焦點要轉到搜尋樹（search tree）了，要深度討論兩種標準的樹結構（tree structure），就是本章所要說明的二元搜尋樹（binary search tree）以及下一章所要討論的 AVL 平衡樹（AVL tree）。這兩種樹其資料都依序排列的，它們之間的差別只在於 AVL 是一種平衡樹，而二元搜尋樹卻不是。-We want to focus the attention of the search tree (search tree), and want to discu
binarytree
- 已知二叉树的任意两种遍历序列，可以得到树的第三种遍历序列。如已知先序和后序序列，输出中序序列。-Known binary tree traversal of any two sequences, can be the third tree traversal sequence. If known after the first sequence and the sequence sequence sequence sequence output.
loveyou
- 两人相恋是上天注定的缘，爱情之树的成长少不了爱心的浇灌，和心爱的Ta共同来建设属于你们俩的爱情花园，让你们的爱情之树茁壮成长。 交流话题可设置公开讨论也可以设置为两位主人私下交流；男女主人可对所有文章评论，普通网友可以对所有公开讨论主题进行评论。 ——七夕情人节的礼物，祝天下所有有情人终成眷属！ -They fell in love that fate edge of the tree' s growth and ultimately, love love the water,
fusetool
- Image Fusion is the process of combining information of two or more images into a single image which can retain all important features of the all original images. Input to fusion is a set of images taken from different modalities of the same scene. O
twotree
- 二叉树的非递归中序遍历+C代码 二叉树的非递归中序遍历+C代码 -two tree+C
2-3-tree
- n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tre
wallace-tree-mult123
- when we want a fast method to multiply two numbers wallace tree method comes first, this code provide the designer new strategies to implement wallace tree code
Binary-Tree
- 关于二叉树先、中、后三种遍历的算法，以及对两棵二叉树进行判等的算法用c语言加以实现-About binary tree first, middle and last three traversal algorithms, and sentenced to two trees and other binary tree algorithm to be implemented in c language
Tree
- 自己实现的二叉树（VAL树）并做了模板，附带自己实现的队列，链表，栈的源码-Own implementation of the two fork tree (VAL tree) and made a template, with their own realization of the queue, the list, stack source