搜索结果

找到约 21 项符合 frequent 的查询结果

技术资料 c51frequent+uart

这是一个实际测试出来好用的一个500KHZ串口输出频率计,不用其它以外硬件,只要有个单片机就行.
https://www.eeworm.com/dl/984656.html
下载: 7
查看: 9863

Internet/网络编程 Summerization based on frequent term in cgi.

Summerization based on frequent term in cgi.
https://www.eeworm.com/dl/620/471737.html
下载: 45
查看: 1061

数值算法/人工智能 A program to find frequent molecular substructures and discriminative fragments in a database of mol

A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.
https://www.eeworm.com/dl/518/174380.html
下载: 191
查看: 1089

Linux/Unix编程 DCI 算法 源代码 DCI: A hybrid Algorithm for Frequent Set Counting

DCI 算法 源代码 DCI: A hybrid Algorithm for Frequent Set Counting
https://www.eeworm.com/dl/619/305082.html
下载: 80
查看: 1050

VHDL/FPGA/Verilog [frequent.rar] - 等精度频率计的设计

[frequent.rar] - 等精度频率计的设计,已经在实验箱上运行的。
https://www.eeworm.com/dl/663/331509.html
下载: 104
查看: 1119

数值算法/人工智能 A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carrie

A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists.
https://www.eeworm.com/dl/518/174383.html
下载: 66
查看: 1090

文件格式 Background maintenance is a frequent element of video surveillance systems. We develop Wallflower, a

Background maintenance is a frequent element of video surveillance systems. We develop Wallflower, a three-component system for background maintenance
https://www.eeworm.com/dl/639/262459.html
下载: 114
查看: 1048

技术资料 XC9500的远程现场升级方法

Throughout this application note, frequent reference will bemade to XAPP058 and VHDL code for th
https://www.eeworm.com/dl/917994.html
下载: 4
查看: 1868

人工智能/神经网络 用VC++實現apriori演算法

用VC++實現apriori演算法,可以找尋Frequent Itemsets,用途於Data Mining是很具參考價值
https://www.eeworm.com/dl/650/326914.html
下载: 176
查看: 1051

压缩解压 In each step the LZSS algorithm sends either a character or a <position, length> pair. Among t

In each step the LZSS algorithm sends either a character or a <position, length> pair. Among these, perhaps character "e" appears more frequently than "x", and a <position, length> pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and t ...
https://www.eeworm.com/dl/617/132267.html
下载: 157
查看: 1126