资源列表
hangcheDlg
- 生产线上的上车数量注册软件的部分源代码，用于注册杭车数量，以便进行自动控制-The production line picking up the number of registered software, part of the source code used to register Hang cars for automatic control
DIJSTRA
- 实现五个点的最短路径的Dijkstra算法-Five points to achieve the Dijkstra shortest path algorithm
RC4
- RC4 关于算法的C语言实现，比较简单，但很简明，一眼就能看懂-RC FORE
duo-chong-xinhao
- 多重信号分类算法（music）在测定信号来向的应用。程序中设定干扰信号和高斯白噪声。-Multiple signal classification algorithm (music) in the measured signal to the application. Procedures set interference signal and Gaussian white noise.
rtrtr
- 快速排序算法用c语言递归实现Quick sort algorithm C language recursive realization-Quick sort algorithm C language recursive realization
log2.c.tar
- C code to comupute the integer-based log2 of a number. It uses two methods and compare the results.
divi
- 给出a和b，若找到的a和b之间约数个数最多的数是,并输出。 -Given a and b, if find a few number between a and b number is up, and the output.
absorption-cross-section
- 采用MATLAB计算，在考虑双光子吸收截面系数是一个动态情况下的模拟情况-Using MATLAB calculated considering two-photon absorption cross section coefficient is a dynamic simulation of the situation in case
Crazy-tea-party
- Crazy tea party，这是一个数论中排列组合的问题，问题是围在一个圆桌坐着的多个人如何能在最短时间内完成座位的对换-Crazy tea party, this is a permutation and combination of number theory, the problem is sitting around a round table on how much individuals can in the shortest time to complete the seat
sgu262
- sgu262：Symbol Recognition(状压DP) 题目大意： 给出k个n∗ m的01矩阵Si，求出一个1尽量少的n∗ m的01矩阵P，满足k个矩阵与该矩阵的交互不相同，也就是说通过该矩阵能表示出给出的k个矩阵。-262. Symbol Recognition time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output:
omp_multMat
- Matrix Multiplication using OpenMP
main1
- 直接贝叶斯方法进行压缩感知中的稀疏信号的重构-direct Beiyasian method for CS reconstruction