搜索资源列表
cpphs
- Haskell，纯正的函数式程序设计语言。特别是利用很简单的叙述就可以完成[链表]、[矩阵]等数据结构。压缩包里有10几个例程 -Haskell, single-function programming language. In particular the use of very simple descr iption can be completed [List], [Matrix] data structure. 10 compression bag several routines
knnjavainweka
- 在weak环境下的knn算法开发 具体需要的说明都在文件包中-weak environment in the Commission algorithm development specific needs of the note in the paper bag
bagoffeature
- 这是图像识别方法bag of feature 的matlab源代码-This is image recognition method bag of feature matlab source code
bag
- 算法分析课程中的经典算法，背包问题的算法实现，仅供参考-Algorithm Analysis of the classic courses in algorithms, knapsack problem algorithm, for reference only
bag
- 在任意位置画任意个点，然后 右击，就自动画出凸包-In any position draw any points, and then right-click, it automatically draw the convex hull of
Backtrack_0-1bag
- 从文件读入数据，用回溯法实现了0-1背包最优解的问题-Read data from a file, using backtracking to achieve the optimal solution of the 0-1 knapsack problem
bag
- 经典的背包问题，运用贪心算法非递归方式求解最优值。-Classical knapsack problem, the use of greedy algorithm for solving the optimal value of non-recursive way.
bag_words_demo
- “袋子模型”特征描述演示，有注释，以及人脸库-bag of the words demo
shuangduandui
- 双端队列应用于优化算法，解决竞赛题：由题目所说，Mr Pote有n个袋子装豆子。Mr Pote从中进行挑选包装，要求找出连续一列袋子，使得它们的豆子总和s在满足s p<=k条件下最大 ，以保证被狗狗吃掉的最少，并且Mr .Pote装的豆子最多。最后输出狗狗吃掉的豆子数目，即s p的结果。 抽象后表述为：给定n,p,k,以及n项数列[wi]，要求找出其一个连续子序列，使得其和s在满足s p<=k的条件下最大，输出s整除p的结果。-Double-ended queue used in
bag
- 背包问题。算法中的背包问题、是我的作业。可能仍有不足。不过能基本实现背包的基本功能-Knapsack problem. Algorithm knapsack problem, is my job. May still be inadequate. But can basically achieve the basic functions of backpack
Bag-of-visual-words
- 基于bag of visual words 模型的人脸二分类代码，使用plsa等两种模式进行分类-Bag of visual words ,face recognition ,plsa
snake
- snake为从网上下载的程序包,该程序包内容较全，涉及了snake的很多改进形式，可以参考。-A good program bag of snake
bag
- 本程序解决背包问题，其中有多个类型的物品，每类物品可以有任意数量。-The procedure to solve knapsack problem, in which there are multiple types of items, each class can have any number of items.
AcM-Bag
- ACM方面关于背包的问题，讲解的比较详细，可以作为ACM竞赛的参考资料~-ACM aspect on the backpack, to explain in more detail, can be used as the reference of the ACM contest
Typical-algorithms-bag
- 包含了很多常见典型的以及其他专业方面的算法实现。-Contains many common typical and other professional aspects of algorithm implementation.
computeBoV
- the Bag of Visual word ( BoV/BoW/BoF ) representation of an image or video
computeBoV
- Computing Bag of visual words
BOF_SVM
- Bag of Feature and SVM example using opencv
Bag
- its a simulation of a fight with the mythical greek hydra.
mixBern
- Just like EM of Gaussian Mixture Model, this is the EM algorithm for fitting Bernoulli Mixture Model. GMM is useful for clustering real value data. However, for binary data (such as bag of word feature) Bernoulli Mixture is more suitable.