-
基于opencv的camshift目标跟踪算法
基于C的opencv目标跟踪算法,选择需要跟踪的目标后,用红色框标出目标并实时跟踪,效果很好。
- 2022-01-27 11:26:41下载
- 积分:1
-
some very useful examples of VC++ programming in Database, giving you the quick...
一些VC++数据库编程实例,教你在VC++数据库编程领域里快速入门-some very useful examples of VC++ programming in Database, giving you the quick totorial in the field of database VC++ programming
- 2022-07-23 23:58:24下载
- 积分:1
-
汽车通讯协议,KWP2000车载故障诊断等
汽车通讯协议,KWP2000车载故障诊断等-Automobile communication protocol, KWP2000 vehicle fault diagnosis, etc.
- 2023-07-22 17:05:06下载
- 积分:1
-
炬力公司给下游公司所开发的固件修复工具
炬力公司给下游公司所开发的固件修复工具-Actions by the company to the lower reaches of the company to develop the firmware restoration tool
- 2022-12-05 00:10:03下载
- 积分:1
-
1时间函数举例4,一个猜数游戏,判断一个人反应快慢。
2有两个磁盘文件A和B,各存放一行字母,要求把这两个文件中的信息合并(按字母顺序排列)输出到一个新文件...
1时间函数举例4,一个猜数游戏,判断一个人反应快慢。
2有两个磁盘文件A和B,各存放一行字母,要求把这两个文件中的信息合并(按字母顺序排列)输出到一个新文件C中。-A function of time, for example 4, a guess the number of games, judge a person reaction speed. 2 There are two disk files A and B, the storage of his letters, these two documents requested information in the merger (in alphabetical order) output to a new file in C.
- 2022-02-05 20:30:00下载
- 积分:1
-
21天学会VC6。很好的VC学习资料。注意,该资料为全英文,英文好的学习效果会好。...
21天学会VC6。很好的VC学习资料。注意,该资料为全英文,英文好的学习效果会好。-21 days, learn to VC6. VC a good learning materials. Note that the data for the whole English, learning good English will be better.
- 2022-03-19 01:39:18下载
- 积分:1
-
绘制等角圆柱投影(墨卡托投影)
地图学专业人士
绘制等角圆柱投影(墨卡托投影)
地图学专业人士-Draw Conformal cylindrical projection (Mercator projection) cartography professionals
- 2023-05-12 03:20:03下载
- 积分:1
-
找怪数组到编写 易语言代码 仅供参考 有兴趣的可以下来学习下...
找怪数组到编写 易语言代码 仅供参考 有兴趣的可以下来学习下-Strange to find an array of easy to write language code for reference only interested in learning that can be down under the
- 2022-04-19 19:27:08下载
- 积分:1
-
K r u s k a l算法每次选择n
K r u s k a l算法每次选择n- 1条边,所使用的贪婪准则是:从剩下的
边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选
取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步,其中e 是网络中
边的数目。按耗费递增的顺序来考虑这e 条边,每次考虑一条边。当考虑某条边时,若将其
加入到已选边的集合中会出现环路,则将其抛弃,否则,将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.
- 2023-02-08 08:10:04下载
- 积分:1
-
获得本机的一些基本信息,如BIOS,磁盘使用量等,开发环境VC...
获得本机的一些基本信息,如BIOS,磁盘使用量等,开发环境VC-some basic information, such as BIOS, disk use, development environment VC
- 2022-01-28 08:34:06下载
- 积分:1