-
Batch-Nearest-Neighbor-Search-for-Video-Retrieval
Batch Nearest Neighbor Search for Video Retrieval
- 2014-03-05 21:10:15下载
- 积分:1
-
PKI
pki 功能文档,对初学者有很大帮助,可以了解pki的相关功能(pki doc useful for beginner)
- 2009-02-13 15:57:49下载
- 积分:1
-
mapx2
mapx在VC++里面的头文件,解压后放进include文件夹即可,虽小有用(Mapx in vc++ header file, extract can be in the include folder after, small and useful
)
- 2013-05-02 23:30:47下载
- 积分:1
-
watereffecto
水面模拟多顶点有波动版本,非实时,有光照颜色(Simulated multi-peak surface of the water fluctuated version, non-real time, with light colors)
- 2009-10-02 15:06:30下载
- 积分:1
-
stop
Stop代码,是作业~很好用,希望通过~~~(Stop code, is a very good job ~ with the hope that by ~ ~ ~)
- 2010-05-15 22:32:49下载
- 积分:1
-
电脑管理器
说明: 1、包括定时关机、AES加密解密、注册表读写、锁屏、密码、开机自启、帮助、关于等
2、关于中包含版权信息,我确保这是我原创的,关于中的版权信息与本账号为同一人
3、直接原版的VS2008工程文件,可导入VS2008。编译结果在VS2008默认状态下的调试目录中(1. Including regular shutdown, AES encryption and decryption, registry read-write, lock screen, password, boot, help, about, etc
2. About the copyright information contained in, I ensure that this is my original, about the copyright information and this account for the same person
3. Direct original version of VS2008 project file, can be imported into VS2008. The compilation results are in the debug directory in the default state of VS2008)
- 2020-12-12 17:24:51下载
- 积分:1
-
MyPictureDrawing2
自己编写的类似画图软件的vc++程序,可以实现铅笔画线、画圆、椭圆等基本画图功能,还有颜色选项(I have written similar vc++ drawing software program, you can achieve a pencil drawing a line, circle, ellipse and other basic drawing functions, as well as color options)
- 2014-05-29 13:36:47下载
- 积分:1
-
YuvField
说明: 从YUV420文件中抽出奇偶场保存为YUV文件,对开发Deinterlace等算法很有用(YUV420 extract from the document saved as YUV parity field documents, such as deinterlace on the development of useful algorithms)
- 2008-11-21 10:37:42下载
- 积分:1
-
config
config.c file from win2000 event log sources.
- 2013-10-13 02:27:37下载
- 积分:1
-
钻石矿工
算法设计中的钻石矿工问题在一座金字塔每块石头上都镶有一块钻石从金字塔的顶端向下收集钻石尽可能收集价值高的钻石,每层每次只能从一块砖斜向左下或斜向右下走到另一块砖上。设计算法求出获取的钻石最大价值及路径。(动态规划)(The problem of diamond miner in algorithm design is set up on every stone in Pyramid. A diamond is collected from the top of Pyramid. Diamond is collected as high as possible. Every layer can only lean from one brick to the left or to the right to go to the next brick at a time. The design algorithm is used to find the maximum value and path of the obtained diamond. (dynamic programming))
- 2020-10-21 08:37:24下载
- 积分:1