搜索资源列表
tutorial on KD TREES
- kd tree 学习指导
R tree method
- The R Treean Efficientand Robust Access Method for Point sand Rectangles
QT3.3.rar
- 这本白皮书介绍了QT C++工具包。QT支持多种平台图形界面程序开发,有“一次编 写,处处编译”的说法。使用单一的源代码树和简单的重编译,能够在Windows95~XP , Mac OS X,Linux, Solaris,HP-UX,和其他使用X11的Unix版本下编制程序。QT应用 程序还可以编译成可在嵌入型环境中运行。QT采用统一的被称为“对象与槽”的机制进行 对象间通信。QT拥有对许多编程领域的完美支持:如2D/3D图形,国际化,XML等。 QT应用程序还可以用QT Dsigne
svmBTA
- 一個基於二元樹為結構的svm分多類分類器svm-BTA,將分多類問題是為多個分二類問題,並結合二元樹的構造來達成分類功能。-A new approch for multi-classfication to employ binary tree architecture.
tomography
- 基于层析成像技术的网络拓扑判定研究.层析成像技术简介,网络拓扑探测技术,网络拓扑推断,系统聚类树算法及实验-Based on tomographic imaging techniques to determine the network topology studies. Tomography profiles, network topology detection technology, network topology inference, hierarchical clustering t
Delphi-TreeView
- Delphi用TreeView树状菜单显示数据库内容dTreeview-Delphi TreeView tree menu to display the contents of the database dTreeview
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
R_tree
- 在论述R树索引技术的相关概念、数据结构、算法描述及性能分析的基础上,提出了一种改进的R*树空间索引结构-R-tree Index in the paper related to the concept of technology, data structure, algorithm descr iption and performance analysis, based on an improved space for the R* Tree Index Structure
C#知识库
- C#知识库是在学习C#时积累的一些知识。本软件用C#编写,运行需要Microsoft .NET框架支持。打开树状节点,双击可查看知识-C# knowledge library is when studies C# accumulates. This software compiles with C#, the movement needs the Microsoft NET frame support. Opens the tree shape pitch point, double-cl
mintree
- 最小生成树 的 C语言 程序绝对可以运行,-Minimum spanning tree of the C language program absolutely can run,
btree
- 一个关于B树结构的详细介绍,尤其是在数据库中利用其实现索引功能-B tree structure of a detailed introduction, especially in the database using its indexing realize
Chap4_BinaryTree
- 二叉树功能的实现,代码摘自PKU数据结构与算法课程网站。-Realization of Binary Tree functions, code taken from PKU data structures and algorithms courses website.
FFF
- 用Kruskal算法求最小生成树,算法与分析实验-Using Kruskal algorithm for minimum spanning tree, Algorithm and Analysis of Experiments
Processing_queries_on_tree-structured_data_efficie
- 论文 数据库查询 Processing Queries on Tree-Structured Data Efficiently-Thesis Database Query Processing Queries on Tree-Structured Data Efficiently
kruskal
- 学数据结构的同学可以看看,这是最小生成树的另一种方法-Data structure of the students can see that this is the minimum spanning tree Another method
FaceDetectionandHeadTrackinginVideo
- 清华大学学位论文;将树状多视角人脸检测器引入粒子滤波器的概率跟踪框架,提出了一种融合了检测信息的跟踪方法;对粒子滤波器的基本算法作扩展,提出了一种融合不同状态量的多个观测模型的方法-Degree Thesis, Tsinghua University the tree multiview face detection probability of the introduction of particle filter tracking framework, a combination of d
NICOMPANY1
- 专家点评: Y P7 `. @ {$ r% pa.功能很强大,可以看出花了很多心血在算法上,非常好。算法上还有一点瑕疵,例如在删除一个员工的同时没有办法自动建立其他员工的上下级关系,必须删除全部下级员工,不是非常合理。此外,界面设计过于简单,应该加强. " W" R+ b* g$ a$ Sb.程序运用了自己的算法来提高Tree控件显示的速度和资源分配,这个非常值得肯定和鼓励。* C. c4 D0 e9 ` J$ w# U c.基本实现所有规定的功能,在所有参赛者中唯一熟 : O
d.doc
- 题目:对记录序列:{55,13,23,72,109,67,2,78,13}分别使用顺序查找和折半查找算法实现特定关键字值记录的查找。然后建立该记录序列的二叉排序树,并在其上实现特定关键字值结点的查找和删除。-Title: on the record sequence: (), respectively 55,13,23,72,109,67,2,78,13 order to find and use half the search algorithm to achieve a specific k
paxieeuew
- 1.创建二叉树 2.输出二叉树 4.二叉树的前中后三序遍历 5.删除特定关键字结点 0.退出程序-1. Create a binary tree 2. Output binary tree 4. Bintree three after the first traversal of 5. Delete specific keyword node 0. Exit procedures
phylip
- 这篇文章,详细的介绍了当前国际最流行的 生物进化树软件使用说明,中文版!-This article, a detailed introduction of the current international the most popular biology evolutionary tree software to use that version of English!