-
校验码用于图像去噪
check out this code for image denoising
- 2023-02-05 21:05:04下载
- 积分：1
-
tc3.0 is based programming software oh
tc3.0 很基础的编程软件哦~解压修改路径直接用~不需要安装-tc3.0 is based programming software oh-extracting revised path directly with no need to install ~
- 2022-04-25 11:46:11下载
- 积分：1
-
tidsp2407 assembler routines, complete source code.
tidsp2407汇编程序例程，完整的源代码。-tidsp2407 assembler routines, complete source code.
- 2022-03-26 08:42:02下载
- 积分：1
-
输局哭电饭锅发动股份电饭锅发动规划规范化股份的韩国发行股份规范化分工很过分...
输局哭电饭锅发动股份电饭锅发动规划规范化股份的韩国发行股份规范化分工很过分-45ftdgfd
- 2022-03-25 16:20:41下载
- 积分：1
-
C++ Builder程序员学习数据结构,里面涵盖了所有你要学习的数据结构的所有源码(二叉树、链表、单链表、双链表、红黑树、快速排序、冒泡排序、哈弗曼树、堆、集...
C++ Builder程序员学习数据结构,里面涵盖了所有你要学习的数据结构的所有源码(二叉树、链表、单链表、双链表、红黑树、快速排序、冒泡排序、哈弗曼树、堆、集合、字典、散列、字典、跳表、图、最短路径、排序。。。。）等等所有数据结构涉及的源码-C++ Builder programmers to learn data structures, which cover all you want to learn all the source data structure (tree, list, single list, double-linked list, a red, black tree, Quick Sort, Bubble Sort, Kazakhstan furman tree, heap, collection, dictionary, hash, dictionary, jump tables, maps, shortest path, and so on 。。。。) sort of all-source data structure!!!
- 2023-06-24 18:10:03下载
- 积分：1
-
移动硬盘盒的电路，包括电路原理图和电路板。
移动硬盘盒的电路图,包括原理图和PCB。-Mobile hard disk box of circuitry, including schematic and PCB.
- 2022-01-26 05:11:19下载
- 积分：1
-
一个ada的编译器
一个ada的编译器-a compiler
- 2023-01-09 17:15:04下载
- 积分：1
-
一个非常简单的彩票软件，大家可以先看看！
一个非常简单的彩票软件，大家可以先看看！-A very simple lottery software, we can take a look!
- 2023-05-18 22:40:04下载
- 积分：1
-
偏移程序，全部都经编译通过，希望给爱好的偏移的朋友已点帮助....
偏移程序，全部都经编译通过，希望给爱好的偏移的朋友已点帮助.-Migration process, all by compiled through, hoping to offset-loving friends have points to help.
- 2023-05-13 04:35:03下载
- 积分：1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分：1
