搜索资源列表
graphyimaseg
- 基于图匹配理论的图像分割，是IJCV上那片经典文献的作者写的程序，简练实用。可以给做这方面的人的参考-based on the theory of graph matching image segmentation, Shangri-La is IJCV on classic literature written by the author of procedures, concise practical. This can be done to the people of reference
GA-based-on-the-graph-edge
- 基于遗传算法的有向图的边序列遍历算法Matlab源码.此函数实现遗传算法，用于用于有向图的边遍历序列的优化 GreenSim团队原创作品-Genetic algorithms are based on the edge to the graph traversal algorithm sequence of Matlab source code. This function implements the genetic algorithm used for edge directed graph
test0_fix_interfence
- 认知无线电中基于干扰图模型的动态频谱分配。此程序是基于固定干扰图模型的分析代码-Cognitive radio interference graph model based on the dynamic spectrum allocation. This procedure is based on the analysis of the fixed interference graph model code
gbvs
- 基于图论的图片显著性分析算法。详细可参见NIPS08 paper: a graph-based saliency-Based on graph theory image analysis algorithm significantly. Details can be found NIPS08 paper: a graph-based saliency
yiqun
- 蚁群算法是一种用来在图中寻找优化路径的机率型技术，该算法具有许多优良的性质，具有一种新的模拟进化优化方法的有效性和应用价值， 是一种求解组合最优化问题的新型通用启发式方法，可以解决一维静态优化问题甚至多维动态组合优化问题。 -Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technology, the algorithm has many goo
Threetypicalspectralclusteringbasedongraphpartitio
- 三种典型的基于图分割的谱聚类方法比较，模式识别方向相关论文。-Three typical graph-based segmentation of spectral clustering comparison, pattern recognition, the direction of relevant papers.
programme
- 标准基类程序，可以在进行图着色问题时，作为基类程序应用-Standard-based class program that can progress graph coloring problem, as the base class procedure applied
MIT_AI_lec_03
- 麻省理工的人工智能讲义第三章 约束满足问题 介绍了各种类型的约束满足问题-AI lecture-3 of MIT talking about Constraint Satisfaction Problems (CSPs)：N-Queens problem；line labelings；Graph coloring；3-SAT； Model-based recognition etc.
www.glzy8.com_doc211710963390
- 遗传算法的编码方式 基于无向图理论的计算机网络k-划分优化遗传算法-Encoding algorithm based on undirected graph theory optimization of computer networks, genetic algorithms k-partition
Shortest-Path-Based-on-Delay-PCNN
- 本文在脉冲耦合神经网络(PCNN2Pulse Coupled Neural Network) 的基础上,提出了时延脉冲耦合神经网络 (DPCNN2Delay PCNN) ,并将其成功地用于求解最短路径,同时给出了基于DPCNN 的最短路径求解算法. Caulfield 与 Kinser 提出了用PCNN 求解迷宫问题的方法,虽然他们的方法也可用于求解最短路径,但所需神经元的数量巨大,而本 文的方法所需的神经元的数量远小于他们的方法. 同时,本文的方法充分利用了DPCNN 脉冲快速并
SemiL
- 利用基于图的分类方法， 半监督学习 ，分类软件。-SemiL is efficient software for solving large scale semi-supervised learning or transductive inference problems using graph based approaches.
Ant-colony-algorithm
- 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-ACO (ant colony optimization, ACO), also known as ant algorithm is a method used to find the optimal path in the graph the probability-based algorithm.
LGE
- 线性图嵌入方法，该方法是一种基于图框架的子空间学习方法，被用于LPP,NPE等流行学习方法中。-(Regularized) Linear Graph Embedding (Provides a general framework for graph based subspace learning. This function will be called by LPP, NPE, IsoProjection, LSDA, MMP ...)
ant_algorithm
- 基于蚁群算法的图的着色问题的研究，毕业论文做的，还是挺好用的-Ant colony algorithm based on graph coloring problem of the studyThesis done, or very good use
jgcp
- 一个基于图搜索原理的九宫重排程序，上学时的作业-Rearrangement procedure based on the principle of graph search Jiugong
metric-learning_survey_v2
- 关于metric learning的综述，涉及到许多的知识：SVM、kernel、SDP等-This paper surveys the field of distance metric learning from a principle perspective, and includes a broad selection of recent work. In particular, distance metric learning is reviewed under different
Natural.Language.Processing
- 基于图形的自然语言处理算法和数据挖掘研究， 国外经典书籍。-Graph-based Natural Language Processing and Information Retrieval Mihalcea Radev CUP 2011
Efficient-graph-based-imag
- 模糊神经网络代码,通过测试可用,算法效率好-Fuzzy neural network code
graphlab-master
- graphlab 关于推荐系统的开源代码-a graph-based, high performance, distributed computation framework written in C++.
Graph-Coloring(HGA)
- 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently