搜索资源列表
Multiple-hypothesis-algorithm
- MHT(多假设跟踪)是一种基于多个扫描周期量测, 进行数据互联的技术, 理论上是解决数 据关联的最优方法。文中重点阐述多假设跟踪算法中数据聚簇、假设生成及假设概率计算、假设约简与 剪枝等环节。从工程角度出发, 采用K best最优假设和N scan 回溯剪枝以提高算法效率和实用-MHT (multiple hypothesis tracking) is a kind of multiple scan cycle measurement based, d
Project1
- Methode Rapson n newtown is the best
EdgeFollowing
- It is an edge detection algorithm. This algorithm prepare Best edge of Input Image by such method like NMS(None Maximum) , Hysteresis method and Laplace filter. --II: [M,N]=size(gim_G) B = zeros(size(gim_G)) B( edgecnd(:,1) ) = 1 ---I
stamp
- acm题,纪念邮票邮局最近推出了一套纪念邮票,这套邮票共有N张,邮票面值各不相同,按编号顺序为1分,2分,……,N分。小明是个集邮爱好者,他很喜欢这套邮票,可惜现在他身上只有M分,并不够把全套都买下。他希望尽量买,最好刚好花光所有的钱。作为一个集邮爱好者,小明也不想买的邮票编号断断续续,所以小明打算买面值a分至b分的b-a+1张连续的邮票,且总价值刚好为M分。 我们用不同的算法求出所有符合要求的方案,以[a,b]的形式输出。-acm questions, post office recently
poly
- A polyalphabetic cipher is any cipher based on substitution, using multiple substitution alphabets. The Vigenère cipher is probably the best-known example of a polyalphabetic cipher, though it is a simplified special case.Polyalphabetic substitution
KNN
- KNN 交叉验证,选出KNN算法中较优的N值-KNN cross validation, for the choice of the best N in KNN algorithm
LWImain
- Industrial CT (ICT), is composed of many subj ects, such as automatlon, commullic“on engineering,mechanical engineering,optoelectronlc technology and image processing,etc.ICT is also n锄ed Computer Tbmography technology(the best testing tecllll0
sgu264
- sgu264:Travel(稳定婚姻问题) 题目大意: 有n个男人和n个女人,每个男人都在心中有对n个女人的喜欢程度,每个女人亦然。求出一种完备匹配的方案使得任意一对男女(除去匹配的n对),满足这对男女之间的喜欢程度不都大于喜欢自己配对对象的程度。-264. Travel time limit per test: 1 sec. memory limit per test: 65536 KB input: standard output: standard
sgu265
- sgu265:Wizards(计算几何) 题目大意: 一个空间直角坐标系内,对一个点有三种操作: 1.平移(x,y,z)⇒ (x+a,y+b,z+c); 2.缩放(x,y,z)⇒ (ax,by,cz); 3.绕一个向量(x,y,z)顺时针旋转α角(角度制)。 对空间内的m个点给出n个操作,求每个点在操作后的坐标。-265. Wizards time limit per test: 0.5 sec. memory lim
yingwenpaiban
- 给定一篇包含 N 个单词的诗,每个单词的物理长度依次为 a[0],a[1],...,a[N-1]。欲将诗分成两个段落,每个段落至少有一个单词,每个段落的排版应遵循以下规则: 每行可容纳的总字符数为 M; 每个单词必须在同一行,不得断开换行; 同一行的每两个单词之间有且仅有一个空格,不考虑其他标点符号; 采用左对齐的方式排版,即每行的第一个单词排在该行最左侧; 假设排版之后共有 m 行,每行末端没有英文单词的空档长度记作 s[0],s[1],...,s[m-1]。 不
ecma
- Insertion sort (fast for already almost sorted arrays): Best case: O(n) for an already sorted array. -Insertion sort (fast for already almost sorted arrays): Best case: O(n) for an already sorted array.
femprb
- Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to comp
4
- 本实验是介绍最佳滤波器在噪声抵消中的应用。令x(n)=d(n)+g(n) ,其中d(n) 是谐波过程d(n)=sin(nw+fai),其中w=0.05π,fai是在π 到-π 间均匀分布的随机变量。 -This experiment is to introduce the best filter in Noise Cancellation x(n)=d(n)+g(n) d(n)=sin(nw+fai) w=0.05π
ML
- 最大似然法(Maximum Likelihood,ML)也称为最大概似估计,也叫极大似然估计,是一种具有理论性的点估计法,此方法的基本思想是:当从模型总体随机抽取n组样本观测值后,最合理的参数估计量应该使得从模型中抽取该n组样本观测值的概率最大,而不是像最小二乘估计法旨在得到使得模型能最好地拟合样本数据的参数估计量。-Maximum likelihood method (Maximum Likelihood, ML), also known as maximum likelihood estim
HERMITE_PRODUCT_DISPLAY
- HERMITE_PRODUCT_DISPLAY is a MATLAB program which displays an image of a function created by the Cartesian product of two Hermite polynomials, such as f(x,y) = h(3,x) * h(1,y). There are five types of Hermite polynomial available. Perhaps the be
frit_toolbox
- 有限脊波变换程序 作者:胡志明N.待办事项 版本历史: 1999年11月:首先运行版本 2000年6月修改变量名的文件,以符合 改变平均值处理方式 2000年9月:新增最好的滑雪道排序为FRAT系数- Finite Radon Transform Author: Minh N. Do Version history: November 1999:First running version June 2000: Modified variable nam
DhivehiInsurance
- ASP.NET Boilerplate shì shǐyòng zuì jiā shíjiàn hé liúxíng gōngjù de xīnxíng xiàndài Web yìngyòng chéngxù de qǐdiǎn. Tā de mùbiāo shì chéngwéi yīgè jiānshí de móxíng, tōngyòng yìngyòng chéngxù kuàngjià hé xiàngmù múbǎn.(ASP.NET Boilerplate is a start
拟合
- 输入N个点的横纵坐标,用一条直线拟合,用类的方法求出最能表现这N个点所在的那条直线的方程。(Enter the horizontal and vertical coordinates of N points, use a straight line fitting, and use the class method to find the equation that can best represent the line in which the N points are located.)
GMDH
- gmdh代码 训练方法 —————————————— 1.将数据集分为训练集和测试集。 2.建立输入层 3.建立所有符合5楼条件的神经元(只考虑“攻”和“受”的关系,不考虑具体的权值)。如果前面几层共有N个神经元,那么我们就需要建立N(N-1)/2个神经元。 4.用最小二乘法确定权值 5.计算每一个神经元在测试集上的表现。 6.选取表现最好的K个神经元放在后面一层。(K可以自己选择) 7.重复3,直到网络的性能足够好,或者网络开始过拟合。(GMDH codeTraining me
新建文本文档 (2)
- 快速排序 对冒泡排序的一种改进,若初始记录序列按关键字有序或基本有序,蜕化为冒泡排序。使用的是递归原理,在所有同数量级O(n longn) 的排序方法中,其平均性能最好。就平均时间而言,是目前被认为最好的一种内部排序方法(Quick sort of an improvement on the bubble sort, if the initial recording sequence by keyword order or order, into a bubble sort. Using a r