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

m-in

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

代码说明:

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

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

发表评论

0 个回复

  • 0712233
    数据结构c语言版,图的遍历,周游世界,无向图的遍历,包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)
    2009-12-20 17:04:09下载
    积分:1
  • 123
    中科大数据结构全部上机实验的实验程序以及报告,内容包括多项式,图,栈,SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
    2020-10-14 19:57:30下载
    积分:1
  • Maze
    c++用栈来实现迷宫求解(c语言数据结构)(c++ stack maze solving (c language data structure))
    2012-10-27 23:08:34下载
    积分:1
  • ahuangCD
    这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
    2013-12-21 18:53:00下载
    积分:1
  • yuesehuhuan
    就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
    2007-11-22 11:35:10下载
    积分:1
  • LR(0)
    简单LR语法分析程序自动生成器的实现,可用作数据结构课程设计(LR (0) grammar analysis)
    2013-09-22 09:26:25下载
    积分:1
  • work_std
    工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法,字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
    2007-01-23 08:57:38下载
    积分:1
  • Huffman
    霍夫曼编码实验报告,内含源代码,编码原理 (Huffman coding lab report, containing the source code, coding theory)
    2011-06-04 20:44:25下载
    积分:1
  • xianxinglianbiao
    c语言编写链式线性表的初始化,创建,插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
    2013-11-09 14:30:30下载
    积分: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
  • 696516资源总数
  • 106579会员总数
  • 0今日下载