登录
首页 » Visual C++ » m-in

m-in

于 2008-09-25 发布 文件大小:6KB
0 218
下载积分: 1 下载次数: 0

代码说明:

说明:  数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法(Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm)

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

发表评论

0 个回复

  • maze
    c语言完成的数据结构几个小算法游戏包括迷宫求解等(C language of complete data structure several small algorithm game includes maze solution, etc )
    2012-03-29 20:37:18下载
    积分:1
  • shiyan1
    数据结构上机操作实验的实验1,线性表的基本操作!!!(the basic operation of sq of date structure)
    2011-12-11 18:49:06下载
    积分:1
  • beipaowenti
    背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
    2012-04-10 19:32:41下载
    积分:1
  • X_bit0mintest
    X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)
    2011-07-02 21:37:01下载
    积分:1
  • Huffman
    程序可以实现哈弗曼自动编码功能!很详细的!很有参考价值!(Program can be Havermann automatic coding features! Very detailed! A good reference!)
    2010-07-21 22:06:48下载
    积分:1
  • sgu-499
    题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
    2011-08-30 21:56:59下载
    积分:1
  • jhgrerfgjz
    一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法(a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix inversion algorithm in C Language)
    2021-03-29 11:39:11下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • lvxingshang
    一个经典的旅行商问题源码,不是最优解,只是一种 思路(A classic traveling salesman problem source is not the optimal solution, just a thought)
    2012-11-09 01:33:02下载
    积分:1
  • BSM
    一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)
    2008-05-04 13:42:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载