-
用C++实现的简单目标识别源代码,特别可以识别红色的目标
用C++实现的简单目标识别源代码,特别可以识别红色的目标-A system which is realized by c++
- 2022-01-26 02:46:04下载
- 积分:1
-
- 2022-03-19 05:38:34下载
- 积分:1
-
ns7002芯片软件编程接口示意图
software schematic interface for programming NS7002 chip
- 2022-03-10 01:08:30下载
- 积分:1
-
example c# program wich demonstrate using multi
example c# program wich demonstrate using multi-layered architecture
- 2023-09-01 18:55:04下载
- 积分:1
-
二叉排序树的建立与插入
二叉排序树的建立与插入-two fork-tree insert the establishment and
- 2022-07-22 04:33:13下载
- 积分:1
-
windows wdm
windows wdm驱动开发 老外写的中文版经典资料-windows wdm-driven programming foreigner to write information on the Chinese version of the classic
- 2022-01-24 17:14:28下载
- 积分:1
-
i.mx27 driver for nand flash
i.mx27 driver for nand flash
- 2022-03-22 00:12:50下载
- 积分:1
-
C++编程实现系统的定时关机、重启、注销
C++编程实现系统的定时关机、重启、注销-C++ Programming System Timing shutdown, restart, write-offs
- 2022-02-04 09:27:34下载
- 积分:1
-
基于贝叶斯技术的邮件过滤的编程实现,SQL Sever 2000中的邮件邮件数据库...
基于贝叶斯技术的邮件过滤的编程实现,SQL Sever 2000中的邮件邮件数据库-E-mail based on Bayesian filtering technology, programming
- 2022-04-28 18:51:55下载
- 积分:1
-
电路布线问题要确定将哪些连线安排在第一层上,使得该层上有尽可能多的连线。换句话说,该问题要求确定导线集Nets={(i,π(i)),1≤i≤n}的最大不相交子集...
电路布线问题要确定将哪些连线安排在第一层上,使得该层上有尽可能多的连线。换句话说,该问题要求确定导线集Nets={(i,π(i)),1≤i≤n}的最大不相交子集。-circuit wiring problem will be to determine which connections in the first layer, making this layer as much as possible on the log. In other words, the problem defined Traverse Set Nets = ((i, (i)), 1 i n) is not the largest subset of the intersection.
- 2022-01-25 16:10:18下载
- 积分:1