搜索资源列表
Classic_Alogrithm_10_Book_EN
- 十部经典算法合集 .chm Fundamentals of Data Structures by Ellis Horowitz and Sartaj Sahni PREFACE CHAPTER 1: INTRODUCTION CHAPTER 2: ARRAYS CHAPTER 3: STACKS AND QUEUES CHAPTER 4: LINKED LISTS CHAPTER 5: TREES CHAPTER
clustering_feature_tree
- Birch，是在1996年提出的。我做的是一个聚类特征树。-Birch, in 1996's. I am doing is a cluster of trees.
91423036
- 关于叔祖 连表 树 二插数 的说明和解析 和详细的说明-even on the table Brother inserted two trees a few notes and analytical and detailed explanation
2-3-trees
- It s a note about data structure. Tree---self balancing and rotate-It's a note about data structure. Tree --- se lf balancing and rotate
shujujiegou-erchashu
- 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \\n )为输入结束标志,输入数列L,生成二叉排序树T； (2)对二叉排序树T作中序遍历,输出结果； (3)计算二叉排序树T的平均查找长度,输出结果； (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2)；否则输出信息“无结点x”； (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and
TwoForkTreesTest
- First preface, medium preface and the empress preface time 历 two fork trees
tutorial on KD TREES
- kd tree 学习指导
Three-dimensionalBoolean-operations
- 研究了三角形表面模型的布尔运算。传统的CSG 算法是基于基本实体的布尔运算进行的，对于由三角形或多边形描述的表面模 型的复杂模型运算则十分困难。通过构建模型的BSP 树，利用BSP 树的空间分割能力，把参与运算的模型分割成两部分，然后，根据交、并、差 各种布尔运算，组合分割后的结果，实现了不规则三维模型的布尔运算-Researched on Boolean Operation of triangle facial model. Traditional CSG algorithm base
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
kd-trees
- 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构：线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
Trees
- 一棵包含6个分支点的树的例子，演示JTree的实现过程。-java Jianshu
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
trees_demo
- its a demonstration of trees being emerging.... they appear like christmas tre-its a demonstration of trees being emerging.... they appear like christmas tress
data-set
- R树的标准数据集，对于R树实现中，起到重要作用！-R standard data set of trees for the R tree implementation, play an important role!
11
- 有一位编程大师，他写非结构化的程序，一位初学者刻意模仿他，也写非结构化的程序。当他让大师看他的进步时，大师批评了他的非结构化程序：“ 对一位编程大师合适的东西未必对一个初学者同样合适，在超越结构化之前，你必须理解编程之道。” 我个人认为作为一个初学者应该踏踏实实的打好程序设计的基础，不要急功近利，舍本逐末。我走过不少弯路，希望大家能和我一样能牢记编程大师的忠告：“对编程大师合适的东西未必对一个初学者同样合适”。 本文所描述的优秀编程风格适合于大部分语言，文章中可能提到你不是很了解的概念，
L4-Trees
- Data Structure : Trees, implemented in Java
CART_thesis
- a document about Classification and Regression Trees
BP-Trees
- Database structures - B trees
Trees
- Preliminaries What is Tree? Implementation of Trees using C++ Tree traversals and applications Binary Trees Binary Search Trees Structure and operations Analysis AVL Trees