搜索资源列表
MovieShow
- Introduction At long last I have finally made what I have wanted to make for so long. Being new to the coding world, this media player (which I call MediaShow ) is my first working software. It is based on the famous D
穷举算法
- 在许多情况下我们需要穷举组合的算法，比如密码词典。这个算法的关键是密码下标进位的问题。另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。如果要提高写文件的效率，可以使用缓冲区，分批写入。-in many cases we need exhaustive combination of algorithms such as password dictionary. The algorithm is the key indice
test10
- While it is perfectly alright to code a 3D environment as a long series of numbers, it becomes increasingly hard as the complexity of the environment goes up. For this reason, we must catagorize our data into a more work
jlab
- JLAB is a set of Matlab functions I have written or co-written over the past fifteen years for the purpose of analyzing data. It consists of four hundred m-files spanning thirty thousand lines of code. JLAB includes func
fixpt.tar
- This module contains a high-performance HE-AAC decoder for 32-bit fixed-point processors. The following is a summary of what is and is not supported: Supported: - MPEG2, MPEG4 low complexity decoding (intensit
Low-ComplexityTransformationandQuantizationinH264-
- presentation of Low-Complexity Transformation and Quantization in H264-AVC
kuaisupaixuway
- 优点： 1、每次快速排序将确定二个元素位置 2、每次快速排序将划分三个区间，优化后续平均时间和空间复杂度 缺点：-advantages : one each rapid sequencing of two elements identified two locations, each rapid sequencing will be divided into three interval, optimizing the average
linear_system_identification.tar
- The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model
sefcs137
- DevExpress.ExpressFlowChart.Suite.v1.37.for.Delphi.BCB.Full.Source-SSG delphi 和 BCB的源码，次空间可以帮你轻松实现流程图类的图标功能，强烈推荐！ The ExpressFlowChart is designed to help you present charts, schemes, hierarchies, and graphs of a
fastOFMDAallocSiPS2004paper
- OFDMA Resource Allocation Simulations A Low Complexity Algorithm for Proportional
00-1393
- Low Complexity Turbo-like Codes，RA码（重复累计码）的经典文献，研究迭代译码和RA码的朋友必读
小游戏：五子棋的设计与实现
- 五子棋的设计与实现 本“五子棋“程序只编写了人机对弈部分，运用了博弈树进行搜索，在选取最优的走步时使用极大极小分析法，考虑到搜索的时间复杂度和空间复杂度，在程序中只进行了2步搜索，即计算机在考虑下一步的走法时，只对玩家进行一步的推测。（程序中的棋盘规格为15*15）。-renju the design and implementation of the "331" procedure prepared by the
一维最近点（传统法）2
- 该程序实现对一维数据轴上的最临近点的求解问题 采用方法：传统方法2:先排序，然后一次线性扫描，得到最近距离，时间复杂性O（nlogn）-the process of achieving a dimensional data axis near the point of the methodology used to solve the problem : The traditional two methods : first order
ClosestPairPoint
- 实现查找一组给定点中的最近点对，通过分治方法将问题求解，简化问题的复杂性。-Lookup a group to the latest sentinel points right, adoption of the partition method of problem solving, simplifying the complexity of the problem.
K－均值聚类算法C++编程
- K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm pr
算法与复杂性_2
- 算法与复杂性_2,主要介绍算法的复杂性，是本经典的电子书(下)-Algorithms and Complexity _2, mainly on the complexity of the algorithm, is the classic e-books (2)
算法与复杂性_1
- 算法与复杂性_1主要介绍算法的复杂性，是本经典的电子书(上)-Algorithms and Complexity _ mainly introduces the complexity of the algorithm, is the classic e-books (1)
混合排序
- 这是一个运用多种排序法对数据进行排序的程序,排序时间复杂性小,空间复杂性小,排序速度快.压缩包包括源程序文件,再vc中运行.-This is a use of a variety of data sequencing procedures for ordering, scheduling time complexity of small, space complexity of small, fast order. Compressed
most
- 计算一个数列的众数，即出现次数最多的那个数，要求尽量低的时空复杂度-calculate a series of the plural, that is the highest number that the number of requests time and space as low complexity
Interior Sort v1.0
- 排序算法的内部复杂度分析,有八个算法,有时间和空间的分析,比较完整-internal sorting algorithm complexity analysis, eight algorithm, time and space analysis, a relatively complete