-
tensorflow
利用tensorflow对mnist数据集进行分类(classify the mnist dataset by tensorflow)
- 2018-11-24 11:49:02下载
- 积分：1
-
huang
1维LBP算法，在一维上做LBP算法，用于提取微表情特征(1-dimension LBP，abstract microfacial expression features)
- 2020-09-02 14:58:08下载
- 积分：1
-
FloodingSimulation
在具有至少十五个节点的网络中模拟洪泛路由。每个数据包应包含一个计数器（n = 10），该计数器在每一跳上递减。(Simulate flood routing in a network with at least fifteen nodes. Each packet should contain a counter (n=10) that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, and each
link can handle only one packet per time interval (i.e. only one packet in total may traverse
the link in either direction). Nodes should include a buffer to queue any additional packets.
Present your results in terms of the number of duplicate packets produced, and the
congestion at each node, and suggest a possible solution for reducing this problem.)
- 2020-06-24 09:40:07下载
- 积分：1
-
《Python从入门到精通》PPT课件
【实例简介】
这就是学python的一堆ppt课件
- 2021-07-09 00:32:11下载
- 积分：1
-
polarbearrepo-master(1)
ioncube decoder - work in progress, only for some versions
- 2019-07-11 20:19:27下载
- 积分：1
-
K-mean算法实现客户分类
K-mean算法实现客户分类。
K-Means算法思想：（1）事先确定常数K，常数K意味着最终的聚类类别数，（2）首先随机选定初始点为质心，并通过计算每一个样本与质心之间的相似度(这里为欧式距离)，（3）将样本点归到最相似的类中，（4）接着，重新计算每个类的质心(即为类中心)，重复这样的过程，直到质心不再改变，最终就确定了每个样本所属的类别以及每个类的质心。(Implementing Customer Classification by K-means Algorithms)
- 2020-06-21 02:00:01下载
- 积分：1
-
yv318
Clustering analysis based on Euclidean distance, BP neural network function fitting and pattern recognition, A noise auxiliary data analysis method.
- 2017-08-16 17:04:05下载
- 积分：1
-
聚类分析
说明： 基于聚类分析的商圈识别，附上完整版的代码和小论文(Cluster analysis based on the identification of business circle, attached small paper)
- 2020-12-14 20:28:40下载
- 积分：1
-
logistics算法
说明： logistics回归分析算法python实现(Python implementation of logistic regression analysis algorithm)
- 2020-04-22 22:21:56下载
- 积分：1
-
FloodingSimulation
说明： 在具有至少十五个节点的网络中模拟洪泛路由。每个数据包应包含一个计数器（n = 10），该计数器在每一跳上递减。(Simulate flood routing in a network with at least fifteen nodes. Each packet should contain a counter (n=10) that is decremented on each hop. When the counter gets to zero, the packet is discarded. Time is discrete, and each
link can handle only one packet per time interval (i.e. only one packet in total may traverse
the link in either direction). Nodes should include a buffer to queue any additional packets.
Present your results in terms of the number of duplicate packets produced, and the
congestion at each node, and suggest a possible solution for reducing this problem.)
- 2020-06-24 09:40:07下载
- 积分：1
