资源列表
FLANN_PSO
- FLANN with Particle Swarm Optimization
VB-MakeBarCode
- VB二维码生成控件分享-VB MakeBarCode
erfenfa
- 二分法求根，可以通过输入待求的方程，并给出两个参考点，即可求出该两点之间的根-The dichotomy roots, through the input of equations to solve, and give two reference points can be obtained by the two root
miebui
- 包括邓氏关联度、绝对关联度、斜率关联度、改进绝对关联度,基于负熵最大的独立分量分析，利用贝叶斯原理估计混合logit模型的参数。- Including Deng s correlation, absolute correlation, correlation of slope, improved absolute correlation, Based on negative entropy largest independent component analysis, Bayesian para
OpenCV-DSP
- 主要是介绍opencv怎么样移植到dsp 上，适合新手的快速上手-Opencv is to introduce how to migrate to the dsp, suitable for beginners to get started fast
Cue-two-fork-tree
- 实现线索树建立、插入、删除、恢复线索的实现。-mplementation of the tree to establish, insert, delete, restore the realization of clues.
huchiti
- 枚举内核对向句柄 外置进程句柄枚举易语言源码- 枚举内核对向句柄 外置进程句柄枚举易语言源码 Enumeration of the kernel to handle external process handle enumeration easy language source code
leader
- 用matlab的s函数功能，实现多智能体间歇通信仿真-Using matlab function of s function, multi-agent simulation intermittent communication
Fibonacci
- 试利用循环队列编写求k阶斐波那契序列中前n+1项的算法。 要求满足： (注意：本题所用循环队列的容量仅为k, 则在算法执行结束时，留在循环队列中的元素应是所求k阶斐波那契序列中的最后k项)-Try using a circulating queue write seeking algorithms k n+ 1-order Fibonacci term lease before that sequence. Requirements are met: (Note: This qu
ICTCLAS2016
- NLPIR/ ICTCLAS 2016系统分词实例-ICTCLAS2016 wordSegment demo
JAX-WS2.1-WebService
- jax-ws2.1 webservice实例 c3p0实例-jax-ws2.1 webservice example c3p0 example
kengpen
- 有详细的注释，是机器学习的例程，计算晶粒的生长，入门级别程序。- There are detailed notes, Machine learning routines, Calculation of growth, entry-level program grain.