搜索资源列表
ch3_state_graph
- 人工智能课件，第三章，图搜索部分：知识表示与推理，状态空间图，与或树-Artificial Intelligence courseware, the third chapter, graph search parts: knowledge representation and reasoning, the state space graph, or tree and
BinaryTree
- 二叉树的模板，实现前序遍历、中序遍历、后续遍历、查找等功能 -Binary tree template to achieve pre-order traversal, in-order traversal, follow through, search and other functions
BplusT
- 实现B+ 树的查找、插入和删除的功能，自动建立B+树，并可以对属性进行索引-Implement the B+ tree search, insert and delete functions, automatically create B+ trees, and can be indexed on the properties
findfile
- 磁盤文件的快速查找,支持中文名 附未例文件-TFindFile is a non-visual component, which can be used for locating files or folders in the file system and directory tree with an extensive set of conditions. TFindFile is capable to locate files based on: Location as
51-practical-subroutine-(assembly)
- 第1章 二进制定点数运算 第2章 二进制浮点数运算 第3章 十进制（BCD码）数运算 第4章 代码转换 第5章 数据变换 第6章 排序、查找和非线性算法 第7章 数学函数 第8章 树和图 第9章 延时与跳转控制 第10章 人机交互接口 第11章 单片机测控接口 第12章 51单片机内部资源编程实例 第13章 单片机数据传输接口 第14章 波形发生与控制实例 第15章 C51单片机软件抗干扰和数字滤波-Chapter 1 dot binary
phonebook
- 一个保存和管理电话薄的图形用户界面，显示若干朋友的电话号码，提供添加、删除和查找等功能，并将各数据项按指定树形关系分类排列显示，将该树形关系保存在指定文件中。-A phone book to store and manage graphical user interface, display some friend s phone number, provide Add, delete, and search functions, and the relationship between dat
zheban
- 折半查找法，二叉树为基础，代码结构严谨精炼-Binary search method, binary tree as the foundation, the code structured refining
kdtree
- 实现二叉树建立，前序、中序、后序、深度等搜索功能-To achieve the establishment of a binary tree, the former in depth search
BFSaDFS
- 基于java语言实现的树的深度优先搜索和广度优先搜索-Based on java language tree depth-first search and breadth-first search
Copy-Detection
- 使用下采样帧构成的列向量的PCA系数作为每帧特征（原则上，也可以使用其他类型的关键帧特征），多帧特征构成特征矢量，以高斯概率模型的后验概率衡量相似性、并建立k维树结构的索引进行搜索，文中对噪声、模糊、再压缩、加Logo，及其这些变换的两两组合进行了实验（丢帧很少时也可以），速度很快，适合于大规模因特网视频的搜索。-Use sampling frame column vector of the PCA coefficients as each frame features (in principl
overlap-interval-
- 区间树算法描述，及其说明，使用代码形式来描述区间树问题-The overlap interval between the tree search algorithm
kdtree
- 特征点匹配时，采用构造KD-tree，用最优节点优先法寻找最佳匹配点-Matching feature points, the tectonic KD-tree, with the optimal node is preferred method to search for the optimal matching point
good
- 深度优先和广度优先搜索序列，并画出所得到的深度优先生成树以及广度优先生成树。假设选择原则是按字母从小到大排列-Depth first and breadth first search sequence, and draw the depth of the get priority spanning tree and breadth first spanning tree. According to the principle of choice is that since the arrange
kdtree
- Kdtree 搜索算法，建树方法，邻近点搜索，查询-Kdtree searching algorithm，build tree， search neigbhor， query
print
- In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The algorithm attempts to find subsets which are common to at least a minimum num
elsisds-document
- In computer science and data mining, Apriori is a classic algorithm for learning association rules. Apriori is designed to operate on databases containing transactions. The algorithm attempts to find subsets which are common to at least a minimum num
huisuzuhe
- 利用回溯算法解决组合问题。构造虚拟二叉树，采取深度优先搜索方式得到解。-Backtracking algorithm to solve combinatorial problems. Construct a virtual binary tree, the depth-first search to get the solution.
algo
- This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
DFS-with-edges.cpp
- This code do Depth First Search and marks every edge as Back Edge, Forward Edge, Tree edge and Cross edge.
b_search_tree
- c++实现的二叉查找树的相关操作，有二叉树的简历，插入，删除，查找，遍历-C++ realization of binary search trees of the relevant operation, have binary tree resume, insert, and delete, find, traverse