-
youhua
代码优化讲义，介绍如何优化代码，使代码运行效率最高(Code optimization notes on how to optimize the code, so that the most efficient code to run)
- 2010-11-05 19:45:46下载
- 积分：1
-
matlab
一个二维静电场，电位函数为φ（x, y），将正方形分成25个正方形网格。有16个内部网格点。假定16个网格点的初值都定为零，试用超松弛法确定16个内部网格点的电位值。(A two dimensional electrostatic field, the potential function for phi (x, y), the square into 25 square grid. There are 16 internal grid point. Assume that 16 mesh point of initial value at zero, trial overrelaxation method to determine the potential value of 16 internal grid point.)
- 2014-01-03 22:37:04下载
- 积分：1
-
double_pendulum_ODE
pendulum finaly okkk
- 2014-01-25 15:50:52下载
- 积分：1
-
kmeans_fast_Color
一个快速k均值彩色图像的分割算法，运行环境是matlab！(A fast k-means algorithm for color image segmentation, the operating environment is matlab!)
- 2014-02-08 08:21:53下载
- 积分：1
-
MAP_algo
MAP algorithm. I m only sharing it with you.
- 2010-12-16 16:54:16下载
- 积分：1
-
集群异构无线传感器网络分簇路由选举协议SEP
集群异构无线传感器网络分簇路由选举协议,一种优于leach的分簇算法(A Stable Election Protocol for clustered heterogeneous wireless sensor networks)
- 2020-07-09 14:18:55下载
- 积分：1
-
RADAR-referance-ppt
雷达原理简要介绍，简单易懂，PDF格式的，适合初学者(The radar principle brief introduction, easy to understand, PDF format, suitable for beginners)
- 2013-04-19 21:54:01下载
- 积分：1
-
svm-mmse-ls
模式识别中常用的算法，有感知机算法，支撑矢量机算法和LS算法，并附有实验报告，源程序！(Commonly used pattern recognition algorithms, has perceptron algorithm, support vector machine algorithm and the LS algorithm, along with lab reports, source code!)
- 2010-09-07 23:02:47下载
- 积分：1
-
ExtractBackground
he files in this package comprise the Matlab implementation of a
foreground segmentation algorithm based upon graph cuts, described in:
Better Foreground Segmentation Through Graph Cuts, N. Howe &
A. Deschamps. Tech report, http://arxiv.org/abs/cs.CV/0401017.
The file extractForeground.m contains a sample function that will
perform a complete foreground segmentation for static camera video.
It uses a number of parameters, which are described in the
documentation. An attempt was made to choose sensible default values,
but they may need to be adjusted for some videos.
More generally, the implementation in extractForeground.m is only a
suggestion of how the graph-based segmentation might be used. The
same approach can be applied with other (perhaps time-adaptive)
background models. The key step is at line 113 of the code, once the
deviation array has been created. The graph-cut segmentation can be
applied similarly to a deviation matrix computed in any other way.
- 2013-11-19 23:41:02下载
- 积分：1
-
a.lin
Dinic method of maximum flow construction,
for O(n^3),
using pseudo-maximal flow construction by
Malhotra - Kumar - Maheshvari.
By Vitold Lipsky ( Combinatorics for programmers , 1988).
Written by: Amir Tulegenov, 2009
- 2015-01-06 16:03:14下载
- 积分：1
