搜索资源列表
tenlei
- function [U,center,result,w,obj_fcn]= fenlei(data) [data_n,in_n] = size(data) m= 2 ％ Exponent for U max_iter = 100 ％ Max. iteration min_impro =1e-5 ％ Min. improvement c=3 [center, U, obj_fcn] = fcm(data, c) for i=1:max_iter if
tower
- 数塔问题，求从塔顶到塔底的路径，且该路径上的节点值的和最大-tower constituted by number，the program will find a path which is the max sum from points in the path.
SphereDecoder
- 用于MIMO检测的sphere decoder程序- This function implements a soft output sphere decoder. Based on the paper: C. Studer, M. Wenk, A. Burg, and H. Blocskei: "Soft-Output Sphere Decoding: Performance and Implementation Aspects", Asilomar 2006
satish
- Avetis Ioannisyan avetis@60ateight.com Last Updated: 11/30/05 LMS Channel Adaptation reset randomizers randn( state ,sum(100*clock)) rand( state ,sum(100*clock)) numPoints = 5000 numTaps = 10 channel order Mu = 0
the-max-sum
- 一串数字序列比如1，3，4，5，7，6……得到其中的最带不连续子序列（要求序列是严格递增的如1，3，4，5，7可以，5，7，6就不可以） 本代码即，最大不连续子序列问题，属于经典的动态规划问题适合初学者-A string of number sequences such as 1,3,4,5,7,6 ... ... be one of the best sequence with discontinuous (which requires a strictly increasing sequ
max_sum
- 求和最大的子数组 在一个一维数组中，找到和最大的子数组（连续的任意个元素）-find the sub array that have max sum
层次分析
- 层次分析法matlab实现 clc,clear fid=fopen('txt3.txt','r'); n1=6;n2=3; a=[]; for i=1:n1 tmp=str2num(fgetl(fid)); a=[a;tmp]; %读准则层判断矩阵 end for i=1:n1 str1=char(['b',int2str(i),'=[];']); str2=char(['b',int2str(i),'=[b',in
numer_utilities_vector
- Some numerical utilities with std::vector containers: mean of the data, max/min elements of the data, sum of the data
stdvector_utils
- Utilities for C++ std::vector conatiners. Mean of the data, Max and min values of the data Diff-functions for differences between samples in the vector Sum of the data Mean of the data