搜索资源列表
WaveOutPlayer
- 使用WaveOut控制声卡来播放WAV、MP3音频的多媒体辅助接口类，你可以将它放到你的程序中并调用类的接口函数。本工程中附带了一个BIG包播放器作为范例，可以打开《命令与征服-将军》等游戏的BIG文件包，播放里面的游戏音乐-Multimedia interface using the WaveOut control card to play WAV, MP3 audio, you can use it in your program and call the class interface f
ini
- conquer items to have fun in the game
qipanfugai_CPP
- 用C++编写的棋盘覆盖问题的解决，其中有非常清楚的注释，帮助学习者了解分治法在类似问题中的应用-Board cover solution written in C++, which has a very clear comments to help students understand the divide and conquer those problems
qipanfugai_matlab
- 用matlab编写的棋盘覆盖问题的解决，有清楚的注释，帮助学习者了解分治法在类似问题中的应用-Matlab prepared by the board covering problems, clear notes, to help students understand the divide and conquer similar problems
MaxMinDemon
- 计算一个数组中的最大最小值，分别使用直接计算和分治法计算，利用C#实现。-Maximum and minimum calculation in an array, were calculated using the direct calculation and divide and conquer, the use of C# implementation.
Linkgame-Design-and-Plug-in
- 用MATLAB实现连连看游戏制作、外挂与攻克。linkgame部分制作了一个连连看，并实现了外挂模式；process部分可以根据摄像头拍摄的一张屏幕灰度图片自动攻克连连看。-Using MATLAB to realize Lianliankan game(linkgame) production, plug-in and conquer. Part linkgame makes a Lianliankan, and realizes plug-in model process part can
suanfa
- 利用分治算法和蛮力算法求最近点对的长度问题-Use divide and conquer algorithm and a brute-force algorithm for the nearest point on the length of the problem
convex_hull
- 凸包问题的算法实现，graham算法实现，分治算法以及暴力算法，有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface
SVD_and_SDD
- 此为比较奇异值分解的算法，QR分解法和分而治之法，并带入了Lapack的选择控制的接口程序，方便在matlab下实用这两种不同的算法进行比较-the algorithm about the decomposition of singular value of matrix comparing the different algorithm in the lapack QR and divide and conquer (DAC)
cPP
- 关于二部图、线段数、树状数组、树的分治的一些POJ题目的解答-About two figure, the number of segments, Fenwick tree, the tree of divide and conquer some POJ topic answers
fenzhifa
- 计算机算法分析里面分治法中很多算法的源码-Computer algorithm analysis, many of which divide and conquer algorithm source code
Sort
- 基于分治策略的实现快速排序算法和归并算法。-Quicksort algorithm and merging algorithm based on divide and conquer strategy
closestpair
- 在visual C++环境中，使用分治策咯实现最邻近点对的查找，并返回最邻近点对距离的平方-In visual C++ environment using divide and conquer tactics to achieve find the nearest point, and returns the nearest point on the square of the distance
2233111
- 采用分治法、动态规划算法实现0-1背包问题的求解；动态演示算法的的实现过程。要求演示界面友好、生动，易于对算法的理解-Divide and conquer, solved using dynamic programming algorithm to achieve the 0-1 knapsack problem process dynamic demonstration algorithm. The demonstration interface is friendly and vivid,
Large-integer
- 大整数，蛮力破解，分治法，改进分治法。程序清晰易懂，有利于帮助理解-Large integer, brute-force, divide and conquer, divide and conquer improvements. Clear and understandable procedures, could help to understand
ECCV2012SupplementaryMaterial
- 论文The Divide-&-Conquer Algorithm for the Paper: Displacement Template with Divide-&-Conquer Algorithm for Signi cantly Improving Descr iptor based Face Recognition Approaches的实现，使用LFW数据库-Paper The Divide- & - Conquer Algorithm for the Paper:
QuickSort
- 快速排序（快速排序）是一种快速排序算法，它被广泛应用于实践。它是用于分而治之的原则。快速排序的工作原理是划分一个给定的数组A [P。 。 R]分成两个非空的子阵列A [页。 。 Q]和A [Q + 1。 。 R]使得在[P每个元素。 。问]是小于或等于每个元素A [Q + 1。 。 R]。然后两个子阵列被递归调用快速排序排序。快速排序的细节描述如下： 1.选择一个支点值（基准）。您可以采取的第一个元素的值 枢轴值，但它可以是任何值，这是在排序的值的范围，即使它不存在于阵列中。 2.分
guibing
- 归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。-Merge algorithm
51-ram
- 霖锋带你征服嵌入式系列教程所有源码，适合所有人群使用-Lin Feng with embedded tutorial series you conquer all the source code, suitable for all people to use
ItemLog
- tq server item conquer online