登录
首页 » Visual C++ » clusterinquest

clusterinquest

于 2006-12-08 发布 文件大小:4KB
0 380
下载积分: 1 下载次数: 101

代码说明:

  cluster in quest聚类算法是基于密度和网格的聚类算法。对于大型数据库的高维数据聚类集合。(cluster in quest clustering algorithm is based on the density of the grid and clustering algorithm. For large database of high-dimensional data clustering pool.)

文件列表:

clique算法
..........\clique.cc
..........\makefile
..........\htm" target=_blank>README

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • gap-width-and-JRC
    计算岩石表面裂隙宽度并求取其表面粗糙度系数(Calculate the rock surface crack width and strike the surface roughness coefficient)
    2016-02-18 03:01:04下载
    积分:1
  • fourier_trans
    傅立叶变换的C语言实现,可在Turbo C以及Visual C++下实现。(Fourier Transform C language, in Turbo C and Visual C under.)
    2006-12-31 11:06:45下载
    积分:1
  • 24
    说明:  给定四个数(1--13),判经过四则运算后能否得到结果24,若能,输出表达式。 (Given the number four (1- 13), after sub after four computing results can be 24, if the output expression.)
    2008-01-03 22:19:45下载
    积分:1
  • calculator
    用mfc实现计算器的基本操作,支持键盘输入,并保留xp风格,可计算平方,幂,时间显示等操作(With mfc achieve the basic operation of the calculator, support for keyboard input, and retain xp style, calculates the square, power, time display and other operations)
    2013-10-23 15:22:24下载
    积分:1
  • LL1 grammer
    vc++实现编译原理中的LL(1)文法的编译过程,非常好用.(vc realization of the principle of compiler LL (1) grammar compiler course, very handy.)
    2005-07-03 21:22:30下载
    积分:1
  • shuzhijisuan
    数值计算实例,主要有LU分解,龙格库塔法,高斯分解法,欧拉法,曲线拟合,曲线插值(Numerical example)
    2014-01-03 10:38:53下载
    积分:1
  • Curve_fitting
    对平面上给定的多点进行多项式曲线的拟合,可设置拟合多项式的次数(Given more points on the plane polynomial curve fitting, you can set the number of polynomial fitting)
    2021-02-14 15:29:49下载
    积分:1
  • atjjs
    埃特金加速法,一个数值分析中的算法,大家先看看哦(Aitken acceleration method, a numerical analysis of the algorithm, we look at the flash open her cloak)
    2007-06-18 10:34:17下载
    积分:1
  • 矩阵链乘
    说明:  距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引(matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker)
    2005-11-17 09:23:42下载
    积分:1
  • Optimal-solution-back-to-France-0-1
    最优解回溯法0-1问题,为了构造最优解,必须在算法中记录与当前最优值相应的当前最优解。(The optimal solution backtracking 0-1 must be recorded in the algorithm, in order to construct the optimal solution, corresponding to the current optimal value, the current optimal solution.)
    2012-04-11 23:41:56下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载