二叉排序树的实现与合并

KNN最邻近算法在c上的实现。输入样本可以根据已经训练好的模型将该词分类，或者重新训练样本，将该新输入的样本进行分类。代码是在C语言上完成的。

给某个玩家100元的资本，让他不停押注直到输光，计算需要赌博多少次？ 如果把次数放在数组ruinLength[]中，进行1000次实验后，看看破产的最大次数、 最小次数和平均次数分别是多少？-100 to a player" s capital, so that he kept until the bet输光to calculate how many times the need for gambling? If the number on the array ruinLength [] in experiments carried out after 1000 to see the largest number of bankruptcy, the minimum number and the average number of how many were?

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozdagi. Digital computation of the fractional Fourier transform. IEEE Trans. Signal Process., 44:2141{2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C . Candan. The discrete fractional Fourier transform, Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform base

利用迪杰斯特拉算法和弗洛伊德算法计算两节点之间的最短路径-get the shortest path between two node with arithmetic of DIJ and floyd

应用背景本代码应用范围是静态背景下的行人检测，通过相邻两帧的像素值差，并在给定的阈值范围中，可以实时动态的找到行人所在区域并标定下来，本代码不可用于动态的行人检测，否则出现很大偏差。关键技术采用帧差法，比较相邻两帧图像对应位置的像素值差异，并用另一个图像空间存储，在给定的阈值范围中，如果像素差异值大于阈值，则将改点的像素值设置为255，如果像素值差异值小于或者等于阈值，则将改点的像素值设置为0。设定完成后，在通过图像预处理，消除图像中噪声，通过像素扫描，找到图像感兴趣范围，并圈定。即可完成图像中行人的动态实时监测。

一个开源的adobeflex开发项目，使用C#和带有语法颜色高亮显示、代码提示和代码完成助手的平台SDK工具

自适应矢量化算法（VQ）源程序VQ-adaptive vector algorithm (VQ) source VQ

您提交的代码通过审核后您才能获得积分，只有内容真实实用，描述详细的源代码才能通过审核。请认真填写以下信息

进制转换 2# to 16# 8# 2# 10# to 16# 2# to 16# 8# 2# 10# to 16# 2# to 16# 8# 2# 10# to 16#-2# to 16# 8# 2# 10# to 16# 2# to 16# 8# 2# 10# to 16# 2# to 16# 8# 2# 10# to 16# 2# to 16# 8# 2# 10# to 16# 2# to 16# 8# 2# 10# to 16#

这表明你 LEACH （低能量自适应聚类层次结构） 的基本工作程序