simd-viterbi-2.0.1

说明：  实现SVM matlab实现。。源于毕业设计(Achieve SVM matlab implementation. . Graduation from)

This article demonstrates how to use the WindowsVistaRenderer and how it was created. Background

学习matlab的好资料第二部分，再此共享下啦。参考参考(Good information to learn the second part of matlab, and then under the shared friends. Reference Reference)

介绍求解TSP问题的遗传算法，附带源代码和城市节点数据。(Introduced genetic algorithm for solving TSP problem,including the supplementary data source code and city nodes.)

this is visuall c++ programmes to remove noise

球赛门票的售票处规定每位购票者限购一张门票，且每张门票售价 50元。购票者中有 m位手持50元钱币，另有n人手持100元。假设售票处开始售票时无零钱。问这m+n人有 几种排队方式可使售票处不致出现找不出钱的局面。(The box office ticket sales are limited to the provisions of each ticket purchase a ticket, and the price of 50 yuan per ticket. Ticket-holders have m-bit hand-held 50 coins, and another n armed with 100 yuan. Suppose no small change when the ticket office began selling tickets. M+ n asking a few people queuing up outside ticket office can not find the money to avoid a situation.)

GM 862 gsm gprs modul visual basic project and aplication. Take photo from GM 862 modul and sample project.

cuda代码，实现合成孔径雷达CSA算法，点目标仿真(c++ code that implements the algorithm of synthetic aperture radar CSA, point target simulation)

When I studied at Peruvian university computer science , We developed a computer vision software about mini robot soccer. And I want to share it It was a first version.

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)