搜索资源列表
DGCL
- DGCL (An Efficient Density and Grid Based Clustering Algorithm for Large Spatial Database)的实现代码,费了很长时间才实现的-DGCL (An Efficient Density and Grid Based C. lustering Algorithm for Large Spatial Databas e) the realization of code, and a very long time to
zhenzhengdezuoye
- 最后的成品vc考勤ACCSEE数据库做的 还有文档 希望大家多多指点jilinshidalvdi@163.com-final product vc attendance ACCSEE database files so there is hope that Members can instruct jili nshidalvdi@163.com
database_edwardversion
- 1.简介 本程序是用纯C语言编的一个基于菜单命令行的数据库系统。可以创建多个数据库,数据库表,字段。其中字段的类型只能为整形,浮点型,字符型和字符串型(最大长度确定,不能改变)。 2.功能 a)数据库存储: 一个数据库存储于一个文件中,打开文件将数据库载入到内存。 保存时将内存中数据重新写到文件中去。 b)数据库管理: 提供数据库的创建,表的创建,字段的创建 提供对数据的查询,删除,修改,排序功能 c)支持SQL部分语句: 支持SELECT 和DELETE语句-1. Introduction o
RayCompressDelphi
- RAY压缩是综合统计和字典方法,针对数据库的压缩算法。这个算法是专门针对重复率比较高的数据的压缩算法,有较高的压缩比。如果全部重复,那么它的压缩率是以2为底的对数。可应用于电力系统数据的压缩。-Ray compression integrated statistics and dictionary method, the database compression algorithm. The algorithm is targeted at high repetition rate of dat
TurboPascalAdvancedProgramming
- 第1章 TURBO PASCAL高级编程技术 1.1 单元及其使用 1.2 与汇编语言混合编程 1.3 与C语言混合编程 1.4 过程类型及其使用 1.5 中断例程的编写方法 1.6 动态数组及其使用 1.7 扩充内存(EMS)及其使用 1.8 扩展内存(XMS)及其使用 1.9 程序的标准数据作代码处理的方法 第2章 实用工具单元 2.1 屏幕输入与输出单元ACRT 2.2 字符串处理单元ASTR 2.3 磁盘
database(c++)
- C++版的数据结构源代码,对初学者有很好的借鉴
DataBase(GridData)
- 读取access数据文件字段的一个程序,使用了datagrid控件完成
METAmorphoses-v0.2.5
- METAmorphoses is a system for flexible and easy-to-use generation of RDF metadata directly from a relational database. Metadata are genereated according to a mapping from an existing database schema to a particular ontology.
EfficientFrontierGUI
- Efficient frontier from Yahoo or database data.
可转债数据库
- 可转债数据库,构造了可转换债券的数据库-convertible bonds database, the structure of convertible bonds database
TextClassification_wbfl_sn
- 整个实验是在Windows环境下使用delphi完成的。选取了600篇文档,数据集共分教育,商业与经济,计算机与因特网,娱乐与休闲,自然科学5个类别, 教育类包括31篇文档, 商业与经济类有93篇文档, 计算机与因特网102篇文档, 娱乐与休闲166篇文档, 自然科学有208篇文档。 目录“DataSet”:RawText中的文本分词后保存在DataSet目录。 数据表“WordsTable”:保存DataSet中所有文本的倒排文档。 其中“目录
pca
- pca人脸识别This package implements basic Principal Component Analysis in Matlab and tests is with grayscale portion of the FERET database. Images are not preprocessed and it is up to the user to preprocess the images as wanted, not changing the fil
trainList
- PCA人脸识别 This package implements basic Principal Component Analysis in Matlab and tests is with grayscale portion of the FERET database. Images are not preprocessed and it is up to the user to preprocess the images as wanted, not changing the
feret
- PCA人脸识别 This package implements basic Principal Component Analysis in Matlab and tests is with grayscale portion of the FERET database. Images are not preprocessed and it is up to the user to preprocess the images as wanted, not changing the fi
fc
- PCA人脸识别 This package implements basic Principal Component Analysis in Matlab and tests is with grayscale portion of the FERET database. Images are not preprocessed and it is up to the user to preprocess the images as wanted, not changing the fi
createDistMat
- PCA人脸识别 This package implements basic Principal Component Analysis in Matlab and tests is with grayscale portion of the FERET database. Images are not preprocessed and it is up to the user to preprocess the images as wanted, not changing the fi
donald e. knuth - the art of computer programming
- 卷3为分拣和搜索,这是本书的第1个修订版,它是对计算机分拣和搜索的一流技术的最全面的研究,它扩展了卷1中数据结构的处理方法,将大小数据库以及内存和外部存储都包含在内。本书包括对计算机方法仔细检查的选择方案,和其效率的大量分析。本书该版的独特之处在于优化了的分拣,以及对通用散列法和排列法的新的理论论述。-Volume 3 for sorting and searching, this is the book of a revised edition, it is sorted on the com
4MySql
- 数据库 是 用 jsp 语言 所编写-database was prepared by the language jsp
find_nearest_neighbours
- % [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) % Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法,在非线性时间序列中很有用,是常用的算法
FUP2算法---解决数据库更新后的关联规则挖掘
- 香港大学的David W.Cheung写的“A General Incremental Technique for Maintaining Discovered Association Rules”中提到的FUP2算法,用来解决数据库更新后的关联规则挖掘-University of Hong Kong, David W. Cheung wrote "A General Incremental Technique for Maintaining Discovered Associatio