搜索资源列表
BigInteger_src
- C# BigInteger class. BigInteger.cs is a csharp program. It is the BIgInteger class. It has methods: abs() , FermatLittleTest(int confidence) ,gcd(BigInteger bi) , genCoPrime(int bits, Random rand) , genPseudoPrime(int bi
analyze_values
- purpose computes histogram and some statistical measures (min, max, ...) for a list of values (one per line) compile gcc -g -o analyze_values analyze_values.c -lm -purpose computes histogram and some stati stica
ch10
- 数据结构（严慰敏）配套纯c代码实验十 typedef int InfoType // 定义其它数据项的类型 typedef int KeyType // 定义RedType类型的关键字为整型 struct RedType // 记录类型(同c10-1.h) { KeyType key // 关键字项 InfoType otherinfo // 其它数据项 } typedef char Ke
No22
- 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then wil
No33
- 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then wil
No44
- 本章将首先介绍怎样在算法设计领域应用这一古老的策略，然后将利用这一策略解决如下问题：最小最大问题、矩阵乘法、残缺棋盘、排序、选择和一个计算几何问题——找出二维空间中距离最近的两个点。 -This chapter will first introduce how the field of algorithm design in the application of this ancient strategy, and then wil
GCluser
- 分级聚类算法：包括k-mean max-dist min-dist 程序使用方法： 程序中打开文件“.dat”-》选择聚类方法-》显示数据 .dat文件格式： 分成几类 输入样本维数 样本个数 下面依次为样本特征向量-Hierarchical clustering algorithms: including k-mean max-dist min-dist procedure to use: program
tripod
- vega中的tripod碰撞检测方法，上房问题在min和Max的参数中。如果max值越大，你爬高就越大。min越小你下坡也就越大。他们的值与你的场景单位有关。他们都是极限值，如果你的房子高度在max值之下就不可能“上房”了。你的坡度落差大于min的绝对值时，他就下不去了。一般用在z和Tripod中常见-vega in the tripod of collision detection methods,上房problem min and
KMEANS
- This directory contains code implementing the K-means algorithm using min-max distance.
waveletcodebyGuleryuz
- Guleryuz写的一个完整的小波变换的源代码。主要包括：wav_basic.c: basic filtering, decimation and upsampling routines. wav_basic.h: interface to wav_basic.c. wav_trf.c: transform routines. wav_trf.h: interface to wav_trf.c. wav_filters
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
Job
- 给定任务序列J1J2 ...Jn，假定只有一台处理机为这批作业服务。每件任务Ji给定一个时限di和对应利润Pi。只有在规定时限之内完成作业，才会得到利润Pi。通过设计合适的算法选择和安排任务子集Ji，使得J中的每个作业都能在各自的时限内完工，且使获得的利润∑Pi总和最大。 令d=max{di} 1≤i≤n，b=min{n,d} 任何最大利润的可完工子序列中的作业个数必不大于b。 -Given task sequence J1
WLS_MM
- 加权最小二乘法&最大最小化优化算法 weighted least-squares + weighted min-max optimization -Weighted least square method
2
- 已知线性表的元素按递增顺序排列，并以带头结点的单链表作存储结构。试编写—个删除表中所有值大于min且小于max的元素(若表中存在这样的元素)的算法程序。-Linear table of elements known by increasing order, and to take the lead in a single node list for the storage structure. Test preparation- a d
daoyou
- if(v0==y)return "请正确选择景点" int v,w,i,j,min CString s1 bool final[num] int d[num] for(i=0 i<num i++) for(j=0 j<num j++) p[i][j]=-1 for(v=0 v<num v++){ final[v]=false d[v]=
CFI
- Common Flash Interface BIN Parser-Dump CFI binary data from any flash memory chip and use this MS Windows application to interpret this file and extract useful information about the flash memory chip: Primary OEM Command
homework
- 输入身高，当输入END,结束输入，输出身高最大和最小值-Input Hight,if Input "END",output max and min
dvm_src
- Video-DVM is a very cheap DVM that shows how an output as complex as a videocomposite signal can be generated entirely in software: two I/O pins and three resistors are all the hardware required. Connected to any TV set
ImageProc
- 一些常用的图像处理cpp和对应的matlab接口 是非常常用的一些代码-Quick list of the source included: imhist_thresh.cpp: Generate histogram from data,# of bins based on unique values. imsmarthist_thresh.cpp: equalize data based on histogram
segmenttreeforminormax
- 线段树求最大最小值,可以成段操作，更新查询-segmenttree for min or max