G729源码

WHAT MIME64 IS: MIME64 is an encoding described in RFC1341 as MIME base64.Its purpose is to encode binary files into ASCII so that they may be passedthrough e-mail gates. In this regard, MIME64 is similar to UUENCODE.Although most binaries these days are transmitted using UUENCODE, Ihave seen a few using MIME64, and I have had requests from friends thatI decode MIME64 files that have fallen into their hands. As long assome MIME64 continues to exist, a package such as this one is usefulto have.

基于遗传算法的图像边缘检测算法。主要内容包含遗传算法的代码，可对各种图像的边缘进行检测，可直接运行，并且检测效果较好。

双边滤波算法的实现，运用pcl库中的第三方库可以进行点云滤波。~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

DM6437测试

显示一个日历表-Showing a Calendar

资源描述很简单的小程序。#include   #include using namespace cv; void main() { IplImage *src; src = cvLoadImage("lena.jpg"); //这里将lena.jpg和lena.cpp文件放在同一个文件夹下 cvNamedWindow("lena", CV_WINDOW_AUTOSIZE); cvShowImage("lena", src); cvWaitKey(0); cvDestroyWindow("lena"); cvReleaseImage(&src); }

应用背景 中国象棋旋风的源代码coony引擎，作者陈朝营，代码简洁，完全可以运行。可供广大象棋编程的爱好者参阅。 关键技术中国象棋旋风的源代码coony引擎，采用ucci引擎。采用PVC剪枝搜索，空着裁剪，静态搜索，历史排序，Hash表等等常用技术。

包括傅里叶变换和傅里叶反变换，c语言编写，简单明了，VC环境验证通过-Including Fourier transform and Fourier inverse transform, c language, simple and clear, VC verification environment through the

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.

一个简单的字符冒泡排序例子-A simple example for bubble chars sorting.