搜索资源列表
U852_DATA_DICTIONORY
- 用友U852数据字典，供二次开发和报表查询使用-UF U852 data dictionary for the second development and use of report queries
M
- 字典树的基本功能是用来查询某个单词（前缀）在所有单词中出现次数的一种数据结构，它的插入和查询复杂度都为O(len),Len为单词（前缀）长度，但是它的空间复杂度却非常高，如果字符集是26个字母，那每个节点的度就有26个，典型的以空间换时间结构。-The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the
excle
- 在excle的宏界面上，通过宏编程，实现字典索引，将两列数据迅速匹配-On excle macro interface, through macro programming, dictionary index will quickly match two columns of data
KSVD
- 字典学习中，采用奇异值分解和k均值方法训练数据得到字典的算法。-Dictionary learning, using singular value decomposition and k-means algorithm training data obtained dictionary.
ksvdsbox11-min
- KSVD 算法 K-SVD通过构建字典来对数据进行稀疏表示，经常用于图像压缩、编码、分类等应用(KSVD algorithm K-SVD sparse data is represented by building dictionaries, often used for image compression, coding, classification, and other applications)
ksvdbox13
- 奇异值分解算法，用于字典的学习和构建，可以很好的对数据进行降维和稀疏化。(Singular value decomposition algorithm for the study and construction of the dictionary, can be a good data for dimensionality and thinning.)
SPAMS
- 先输入数据生成相应的字典，再输入检测信号后得到用字典稀疏表示的结果(First input data, generate the corresponding dictionary, and then input the detection signal to obtain sparse dictionary results)
AnalysisKSVDbox
- K-SVD可以看做K-means的一种泛化形式，K-means算法总每个信号量只能用一个原子来近似表示，而K-SVD中每个信号是用多个原子的线性组合来表示的。 K-SVD通过构建字典来对数据进行稀疏表示，经常用于图像压缩、编码、分类等应用。(K-SVD can be regarded as a generalized form of K-means. The total K-means algorithm can only approximate one signal for each sem