SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video a

实现卡洛图的自动化简功能，最大字符为4个，即对于一个4 x4的数，将其中可以合并的1化简，得出最简和最优的结果，与手工化简结果一致-Calo plans to achieve automation SR function, the largest of the four characters, that is for a 4 x4 few, which will be an amalgamation of a simplification, reduction and produce the m

基于非周期随机共振的实现，求最大相关系数有明显的效果-Implementation based on aperiodic stochastic resonance

本paper较基础,是对于sr理论最简单的理解,用最直观的领域插值的方法解决的,新手可以()