资源列表
Gradient-sharpening-the-image-code
- 图像中梯度锐化的代码,对于学习图像处理的朋友应该有所帮助-Gradient sharpening the image code, image processing for the study should help a friend
DIY80c52-ledbang.txt
- DIY80c52 ledbang.txt define uchar unsigned charde fine uchar unsigned chardefine uchar unsigned char define uchar unsigned charde fine uchar unsigned char-define uchar unsigned char define uchar unsigned char define uchar unsigned char define uchar u
DX-Project-3
- 对于directx初学者来说，这是一些不错的代码资料-For directx beginner, this is some good code information
arpit
- 应用matlab的一种新的人脸识别算法，自己的尝试，希望可以有用，-Matlab application of a new face recognition algorithm yourself, which I hope can be useful, thank you
FpsEasyDemo
- 对于研究图像处理的爱好者来说这是一个很好的而源代码-For the study of image processing enthusiasts, this is a very good and the source code
MyCalendar
- 能够在单文档MFC界面中实现一个钟表时钟的界面，要与系统时间保持同步 思路：在应用程序中经常有些任务需要后台处理，实现的办法由两种：计时器和OnIdle循环处理。 -Can in a single document MFC interface implementation in a clocks and watches clock interface, to keep pace with the system time Idea: in applications often some
avi
- 程序运行出现一个单文档窗口，在这个单文档空白窗口的任意位置单击鼠标左键可以调出视频播放起的窗口，可以播放avi的视频文件，可以调整音量，画面大小，播放，停止。-Program running the emergence of a single document window, in this single document window at any position of blank click the left mouse button to call up a video broadcas
xiaohuaban
- 很好的directx编程源代码，侧重于画图功能密切很好-Good directx programming source code, very closely focused on the drawing functions
GDI
- 很好的gdi画图源程序代码，功能很全，且覆盖面很广-Good gdi drawing source code, functionality is very full and very wide coverage
Digit
- msp430驱动八段码显示器，含164驱动-eight out msp430 driver code display, with 164 drivers
bt
- 科技创新(7)智能小车控制算法软件模拟实现，根据测量当前小车的位置、速度和预瞄点位置与赛道之间的关系控制小车的速度，舵机大小、档位、油门和刹车情况。-Science and technology innovation (7) intelligent car control algorithm simulation software to realize, according to the current measurement car position, velocity, and the po
AStar
- A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。公式表示为： f(n)=g(n)+h(n),其中f(n) 是从初始点经由节点n到目标点的估价函数，g(n) 是在状态空间中从初始节点到n节点的实际代价，h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) is a static network algorithm for solving the shortest most effective way. Formula is expressed as: f (n)