经典阵列处理教程：《Optimum_Array_Processing》的英文版，中文名《最优阵列处理技术》Harry_L._Van_Trees著

Behavior trees are used by AAA studios to create a lifelike AI. With Opsive's Behavior Designer, you can bring the power of behaviour trees to Unity! Behavior Designer is a behaviour tree implementation designed for everyone - programmers, artists, designers. Behavior Designer offers an intuitive visual editor with a powerful API allowing you to easily create new tasks. It also includes hundreds of tasks, PlayMaker integration, and extensive third party integration making it possible to create c

图像处理库-Mikolajczyk图像库.bark.bikes.boat.graf.leuven.trees.ubc.wall.包括.ppm格式和转换好的.png格式的图片数据集

For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high-dimensional problems that are faster than linear search. Approximate algorithms are known to provide large speedups with only minor loss in accuracy, but many such algorithms have been published with only minimal guidance on selecting an algorithm and its parameters for any given problem. In this paper, we describe a system that answers the question, “What is the fastest approximate nearest-neighbor algorithm for my data? ” Our system will take any given dataset and desired degree of precision and use these to automatically determine the best algorithm and parameter values. We also describe a new algorithm that applies priority search on hierarchical k-means trees, which we have found to provide the best known performance on many datasets. After testing a range of alternatives, we have found that multiple randomized k-d trees provide the best performance for other datasets. We are releasing public domain code that implements these approaches. This library provides about one order of magnitude improvement in query time over the best previously available software and provides fully automated parameter selection.

KentaroToyama的 Wallflower paper中的图像测试集 原 paper：Kentaro Toyama, John Krumm, Barry Brumitt, Brian Meyers, "Wallflower: Principles and Practice of B

一篇著名的数据库数据检索论文，由加州伯克利大学的Antonin Guttman撰写。 论文索引： 在计算机辅助设计跟空间数据应用中，为了能高效处理空间数据，数据库系统需要一个检索功能从而根据空间位置来迅速抓取数据。但是，传统的检索方法不适合用于多维空间中的有限大小的数据对象。在这篇论文中我们设计了一个叫做R-树的动态检索结构，这种设计满足了我们新的需求并且包含了搜索跟更新数据的算法。通过一系列的测试我们发现这种数据结构非常高效并认为这种结构适合于当前的空间数据应用数据库系统。

Harry Van Trees《检测、估计和调制理论》第1卷 检测、估计和线性调制理论 中文版

Dan Gusfield的字符串处理的经典书籍Algorithms on Strings, Trees and Sequences，完整版，550页。pdf版本

Introduction of decision trees_J.R. Quinlan;ID3