-
lbgVQ
利用Matlab实现矢量量化LBGVQ算法，(failed to translate)
- 2010-12-28 19:46:16下载
- 积分：1
-
BlockGame
俄罗斯方块的游戏 在别处下载的 希望对你们有用(Tetris game download elsewhere that you want to be useful)
- 2011-11-27 20:40:43下载
- 积分：1
-
OpenGLSelect
OPENGL环境下的实现点、线、圆、矩形的绘制及其选择。计算机图形学大作业。(The OPENGL environment under of the realization order,the line,circle,rectangle draw and it choose.The calculator sketch learns the big homework
)
- 2011-12-27 21:13:45下载
- 积分：1
-
LuaFramework_UGUI-1.0.5
说明： tolua# is a Unity lua static binder solution. the first solution that analyzes code by reflection and generates wrapper classes.
It is a Unity plugin that greatly simplifies the integration of C# code with Lua. which can automatically generate the binding code to access Unity from Lua and map c# constants, variables, functions, properties, classes, and enums to Lua.
tolua# grows up from cstolua. it's goal is to be a powerful development environment for Unity.
- 2017-08-18 11:04:49下载
- 积分：1
-
MATLAB-7.X
matlab7.X程序开发以及matlab编程学习(matlab7.X program development and learning matlab programming)
- 2013-10-29 08:54:49下载
- 积分：1
-
wpf ui框架
wpf ui框架
- 2016-07-06下载
- 积分：1
-
2DLDA
二维线性判别 功能比较强 二维线性判别 功能比较强(Img = imread( twoObj.bmp ) )
- 2009-05-28 19:22:35下载
- 积分：1
-
PCA
在WINDOWS环境下，使用MATLAB写的PCA代码，移植性好，对于做PCA的能方便使用！(In the WINDOWS environment, the use of PCA written in MATLAB code, portability, and for doing the PCA can easily use!)
- 2013-09-14 17:13:24下载
- 积分：1
-
4.2
基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法，路径必须经过要求的必经点，且不成环。
该算法采用了一种自适应调整的方法，经过多次迭代，使解收敛。 但只是寻找了一个略优的可行解（每次迭代都基于贪婪算法寻找），不能保证最优解。而且如果图过于稀疏，因为收敛速度过快，可能导致问题无解（收敛于一个局部最优解，没有经过所有点）。 解决相对稠密的图（每个点的平均出入度4以上），表现良好。
备注：里面有一个QT的工程，可以直接打开（源码里没用QT的库）(Weighted Dijkstra and breadth first search based on a shortest path algorithm must point to point to the map, the path must pass through points, and not a ring.
This algorithm adopts an adaptive method to adjust, after several iterations, the convergence of solution. But only to find a slightly better feasible solution (each iteration is based on the greedy algorithm to find), can not guarantee the optimal solution. And if the graph is too sparse, because the convergence speed is too fast, it may lead to the problem of no solution (convergence to a local optimal solution, not after all points). To solve the relatively dense graphs (each entry point average above 4), good performance.)
- 2016-04-06 11:35:48下载
- 积分：1
-
学习opengl加载obj的例子
这是一个网上转载的基于linux的opengl加载ibj的一个学习代码，直接解压 放在linux上任意位置就可以编译通过，当然要先安装必须的安装一些包和库
- 2022-07-24 08:34:22下载
- 积分：1
