资源列表
iic
- 专业级飞思卡尔s12单片机，iic初始化及输入采集程序，初学者勿点-The professional level Freescale s12 microcontroller, iic the initialize and input acquisition program, beginners do not point
I2c
- msp430f169控制zlg7290程序-msp430f169 control zlg7290 program
TI
- msp430f46XX原理图，pdf说明-msp430f46XX schematic, pdf Descr iption
new--2
- jsp 内置对象 基础内容程序员须知道滴-jsp inclue reponse request session application
Z2103Sch.pdf
- Schematic of ZLPC2103 evaluation board saik on www.the0.net The Zero Research Institute presents a brand new ZLPC2103 Development Board for Philips NXP LPC2103 ARM Family. The ZLPC2103 Development board helps you get started writing programs and
05349172
- this ducument abuot cog radio
UMLRose
- uml与rose用例图类图活动图状态图顺序图协作图-uml use case diagram with rose class diagram activity diagram state diagram sequence diagram collaboration diagram
The-LCS-algorithm
- LCS算法实现简单中文文本相似度分析-最大公共子串-The LCS algorithm to implement a simple text similarity analysis- the largest public substring
Levenshtein-Distance
- 在日常应用中，文本比较是一个比较常见的问题。文本比较算法也是一个老生常谈的话题-In everyday applications, the text comparison, is a relatively common problem of text comparison algorithm is a cliche topic
Nakatsu
- Nakatsu算法在计算匹配字符串的情况下，有着良好的时间复杂度O(N(M-P))和空间复杂度O(N2)，而且在采取适当的优化手段时，可以将空间复杂度优化到O(N)，这是一个很诱人的结果。下面将全面介绍Nakatsu算法。-Nakatsu algorithm in calculating matching string case, have a good time complexity O (N (M- P)) and the space complexity is O (N2), and wh
Needleman-Wunsch
- 本文介绍基于最长公共子串的文本比较算法——Needleman/Wunsch算法。-In this paper, the text comparison algorithm based on the longest common substring Needleman/Wunsch algorithm
linear-space
- 文本比较算法Ⅵ——用线性空间计算最大公共子序列（翻译贴）-Text comparison with linear space algorithm calculating maximum public subsequence (translation is stuck