搜索资源列表
LC-tries
- LC_trie 算法程序源代码-LC_trie algorithm source code
triangulation_corner.m
- a MATLAB program which tries to correct situations in which a triangulation includes corner triangles, that is, triangles which have two sides on boundary
gyy
- 从因子分析的角度出发解决基因表达谱分析问题。为解决独立成分分析方法在求解过程中的不稳定性，提出一种基于选择性独立成分分析的DNA微阵列数据集成分类器。首先对基因表达水平的重构误差进行分析，选择部分重构误差较小的独立成分进行样本重构，然后基于重构后的样本同时训练多个支持向量机基分类器，最后选择部分分类正确率较高的基分类器进行最大投票以得到最终结果。在3个常用测试集上验证了本文设计方法的有效性。-This paper tries to deal with gene expression proble
ExtendedHashing.cpp
- this program implements extendible-hashing using tries as lookup-directory. it is more efficient than simple array based implementation-this program implements extendible-hashing using tries as lookup-directory. it is more efficient than simple arra
Algorithms.in.C.Parts.1-4.Fundamentals.Data.Struct
- 经典算法书(中文版).《C算法》介绍了当今最重要的算法，共分3卷，本书是第1卷。第1卷分4部分、共16章。第一部分“基础知识”（第1～2章）介绍了基本算法分析原理。第二部分“数据结构”（第3～5章）讲解算法分析中必须掌握的数据结构知识。主要包括基本数据结构、抽象数据结构、递归和树。第三部分“排序”（第6～11章）按章节顺序分别讨论了基本排序方法（如选择排序、插入排序、冒泡排序、希尔排序等）、快速排序方法，归并和归并排序方法、优先队列与堆排序方法、基数排序方法以及特殊目的排序方法，并比较了各种排序
multiple_tree
- 根据kurse版数据结构改成的课程文档。此章包括内容：B树，Tries 树，Red-Black树。-According to kurse version of the data structure into the curriculum document. This chapter covers: B tree, Tries tree, Red-Black tree.
HopfieldNet
- Symbol recognition with Hopfield Net. It stores several symbol then tries to recognize corrupted symbol.
Recognizer
- Letter recognition with Multilayer Perceptron. It learns 10 first letters and then tries to recognize drawn symbol.
adaboost_version1b
- 最经典AdaBoost实现，适合初学，有大量详细的注释，容易理解-This a classic AdaBoost implementation, in one single file with easy understandable code. The function consist of two parts a simple weak classifier and a boosting part: The weak classifier tries to find the b
WELL
- 它试图解决的问题，薄弱的标签是一个多学习一种新标签的问题，其中只有部分标签集与每个提供相关培训的例子-This package includes the MATLAB code of the multi-label learning algorithm WELL. It tries to deal with weak label problem which is a new kind of multi-label learning problem, where only a partial la
Time_frequencyAutomaticGainControl
- This code implements automatic gain control for audio signals, which attempts to apply a smoothly-varying gain to an audio waveform in order to keep its energy close to some target level. This version also tries to balance the energy in individual fr
hand_gesture_recognition
- Hand gesture recogntion Algorithm:- This histogram-based algorithm tries to detect if the hand is not raised, raised, diagonally down, raised straight, or raised diagonally up and much more.
histogramequalization
- In histogram equalization we are trying to maximize the image contrast by applying a gray level transform which tries to flatten the resulting histogram. The gray level transform is a scaled version of the original image s cumulative histogram. That
Introduction-to-data-compression
- Compression is used just about everywhere. All the images you get on the web are compressed, typically in the JPEG or GIF formats, most modems use compression, HDTV will be compressed using MPEG-2, and several file systems automatically compress
simplex
- this program tries to find optimum point
4Cyclist-problem-simulation-model
- 4Cyclist problem simulation model Four cyclists are at the desert. Each of them starts from a different location and tries to reach the other ones. Cyclist 1 goes straight to cyclist 2, cyclist 2 straight towards cyclist 3 etc. such that finall
mat2figure
- 快速浏览时间序列数据。而且可以直接创建时间序列的图示，非常方便快捷。-MAT2FIGURE allows you to review timeseries data contained in a matfile very fast and efficiently. Furthermore, the created figure file can be used to distribute these data. After opening a matfile, mat2figure scan
memory_test
- MEMORY_TEST is a MATLAB program which declares and uses a sequence of larger and larger arrays, to see what the memory limits are on a given computer.The program tries an increasing series of values of N, using powers of 2, between limits that you se
KSVD_Matlab_ToolBox
- The K-SVD is a new algorithm for training dictionaries for linear representation of signals. Given a set of signals, the K-SVD tries to extract the best dictionary that can sparsely represent those signals.
Tries
- presentation on the TRIES data structure