-
MATLAB_Graphics__Drawing_and_GUI
说明： 《MATLAB图形技术——绘图及图形用户接口》西北工业大学出版社，1999年版，周明等编著。介绍了matlab绘图方法和图形对象的特性及图形用户接口的设计技术。(MATLAB graphics- drawing and graphical user interface, Northwest Industry University Press, 1999 edition, Zhou Ming, eds. Introduced matlab drawing method and graphic object properties and the graphical user interface design.)
- 2010-04-19 16:35:31下载
- 积分：1
-
combind-program
用于MATLAB作图中，多张图的合并（里面的文件路径需要根据需要更改）(For the MATLAB plot, the multiple number of pictures merger (inside the file path needs to be changed as needed))
- 2013-09-12 11:50:24下载
- 积分：1
-
Matlab
Matlab命令大全，很全面地包涵了Matlab的命令，方面学习查询。(Matlab order Daquan, very comprehensive bear the Matlab command, in learning about the query.)
- 2013-11-10 22:49:37下载
- 积分：1
-
SIC
串行干扰消除技术有利于消除MIMO系统的多天线干扰，本文件包含ZF-sic与MMSE-sic(Serial interference elimination technology to eliminate the antennas of the MIMO system interference, this file contains the ZF- sic and MMSE- sic)
- 2021-04-15 22:28:54下载
- 积分：1
-
MATLAB
用 MATLAB控制摄像头读取图像 可以实现拍照功能(just do it)
- 2012-04-18 10:16:15下载
- 积分：1
-
gaborfilter
Gabor filter algorithms in matlab
- 2011-05-24 19:50:51下载
- 积分：1
-
Training_TUM_GS_Simulink
Training matlab simulink
- 2014-09-03 23:37:17下载
- 积分：1
-
Graph-theory-algorithm-set
对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。(Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate.)
- 2021-02-07 18:59:55下载
- 积分：1
-
TSP
旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)
- 2015-01-18 21:43:12下载
- 积分：1
-
sparse-representation
Sparse representation
- 2012-01-26 13:17:32下载
- 积分：1
