搜索资源列表
OpenCLFilter
- 實現圖像濾波與 7x7過濾器。這個想法是提出一個 OpenCL的算法，將在所有的卡兼容的基本執行 OpenCL的不帶擴展名。由於我們收到一些電子郵件，詢問有關如何實現圖像過濾器，不要使用圖片，做基本的東西 liike反相顏色，我們還公佈了簡單的圖像過濾器，用戶可以編譯過濾器在執行時間和選擇哪個設備是用於編譯的代碼-Image filtering and 7x7 filter. The idea is to propose a OpenCL algorithm, all the cards wil
ant
- 基本蚁群算法，c++下可以运行，主要是原理跟思路-Basic ant colony algorithm, c++ can run, mainly with the idea of the principle
flody
- 图论算法 求SAP矩阵的基本思想是图的最短路的问题。 由于铁路的运输费用与线路的长度不是线性关系，必须对铁路网做一些预处理才能套用图的标准最短算法。 -SAP matrix graph theory algorithm for getting the basic idea is to map the shortest path problem. Since the railway transport costs and the length of line is not a line
transductive-SVM
- 对直推式支持向量机的较为经典的介绍，包含一些直推式学习的思想，算法-Direct Push on Support Vector Machine, introduced a more classic, contains a number of Direct Push the idea of learning, algorithm
bp
- 用bp算法拟合正弦曲线，并采集数据。其基本思想是梯度下降法。-Sine curve fitting algorithm with a bp, and collecting data. The basic idea is the gradient descent method.
NESTA_v1.0
- NESTA，非常好的优化算法,The algorithm uses two ideas due to Yurii Nesterov. The first idea is an accelerated convergence scheme for first-order methods, giving the optimal convergence rate for this class of problems. The second idea is a smoothing technique t
AStar
- 八数码问题的A*算法实现，java的伪代码，基本思想-8 digital issues of A* algorithm, java pseudo code, the basic idea
bingreedy
- 此源程序为解决一维集装箱装载问题，但是为二维和三维算法提供了很好的思路。-This source code to solve one-dimensional container loading problem, but for the two-dimensional and three-dimensional algorithm provides a very good idea.
a-level-set-inariable-distance
- 李春明提出的无需水平集初始化的思想是图像分割的一个重大突破，重庆大学的何传江教授对该算法进行了改进，里面是我的实现算法-Li Chunming s no need to initialize the idea of the level set image segmentation is a major breakthrough, Chongqing University, Professor He Chuanjiang to improve the algorithm
Bipartite
- 图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea
work
- 运用遗传算法的思想，通过MATLAB及遗传算法工具箱，实现了函数最值的运算求解！-The idea of the use of genetic algorithms, and genetic algorithm through MATLAB toolbox to achieve the most value of the function of computing to solve!
A
- 这是我根据A*算法，通过javascr ipt实现的最短路径程序。可以说，程序非常糟糕，不过总算是实现了。思路是起点和终点的跑动过程中，我们中间可能会遇到障碍物，所以，我们不能仅仅是两点一直线，而是聪明的饶过障碍物进行聪明的跑动-This is my under the A* algorithm, through the javascr ipt to achieve the shortest path procedure. It can be said that the procedure is
IDEA_in_C
- C实现的IDEA加密算法，可作为应用参考。-C to achieve the IDEA encryption algorithm, the application can be used as reference.
883
- 功能: 用回溯算法求解883喝酒问题。注意: 该程序尽可能用与算法一致的思路实现算法, 力求简单明了, 注重算法的清晰性-Function: The retrospective algorithm 883 alcohol problem. NOTE: The procedures and algorithms as much as possible consistent with the idea of algorithm to simple algorithms focus on the cl
tanxin
- 贪心法的基本思路： ——从问题的某一个初始解出发逐步逼近给定的目标，以尽可能快的地求得更好的解。当达到某算法中的某一步不能再继续前进时，算法停止。-Greedy basic idea:- from the question of a gradual solution of the initial approximation to set targets to as quickly as possible to seek a better solution. When an algorithm
8queens
- 这是八皇后算法，自己写的，但是主题思想一样，深度优先，大家参考-This is the eight Queen s algorithm, wrote it myself, but the main idea, the depth-first, we refer to
SOR
- SOR算法的基本思想以及详细的代码实现和运行情况。-SOR algorithm basic idea and the detailed code and operational situation.
MSA_MST
- Multiple Sequence Alignment Using Maximum Spanning Tree 生物信息学中一个重要topic：多序列联配。这里用最大生成树的思想来进行联配，算法为C语言实现。本程序在Dev-C++，Win Vista环境下实现。-Multiple Sequence Alignment Using Maximum Spanning Tree Bioinformatics an important topic: Multiple Sequence Alignme
HuffmanCode
- 本算法的作用是利用建立的huffman编码进行编码和译码。首先要建立huffman树，其主要的思想是权大的外结点靠近根，权小的远离根。大体的算法是在n个结点中不断的选取两个相对小的结点建立huffman树，直到全部结点都在huffman树中。-The role of this algorithm is the use of established code huffman encoding and decoding. First of all, to establish huffman tree
PRIM
- PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。-PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.