搜索资源列表
chromium_configure
- 集群计算环境下的网络通讯与负载系统，通过该软件可使集群计算机系统的负载达到最佳平衡-cluster computing environment with a network communications system load, adoption of the software will enable computer clusters load on the system to achieve the best balance
K-meanCluster
- How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the f
dbscan
- DBSCAN是一个基于密度的聚类算法。改算法将具有足够高度的区域划分为簇，并可以在带有“噪声”的空间数据库中发现任意形状的聚类。-DBSCAN is a density-based clustering algorithm. Algorithm change will have enough height to the regional cluster. and to be with the \"noise\" of the spatial database found clusters of
动态规划----矩阵连乘问题
- 动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(i<j)表示矩阵Mi连乘到Mj的最小工作量 3）下方元素Di,j(i>j)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic prog
pp-1.5.7RC
- Parallel Python (PP) PP is a python module which provides mechanism for parallel execution of python code on SMP (systems with multiple processors or cores) and clusters (computers connected via network). It is light, easy to install and int
file-2
- Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines this reflects its
LabVIEW-8.20-VI
- 第2章 牛刀小试 第5章 程序结构 第6章 字符串，数组，簇和矩阵 第7章 Chart图表和Graph波形图 第8章 Express VI 第9章 文件IO 第10章 子VI 第12章 人机界面交互设计 第13章 数学分析与信号处理 第14章 数据采集与仪器控制-Chapter 2 chopper small test Chapter 5 Program Structure Chapter 6 strings, arrays, clusters and ma
cluster-in-linux
- 在linux下的一个集群建立的资料，详细介绍了方法和使用的工具-High Performance Linux Clusters with OSCAR Rocks OpenMosix and MPI
labview
- labview程序设计 一些基本的labview程序 入门知识 字符串，数组，簇和矩阵-labview labview program design process started some basic knowledge of strings, arrays, clusters and matrices
Distributed-Shared-Memory
- 分布式共享内存的在Cluster上的实现-An implementation of distributed shared memory on clusters of workstations, connected via and IP-based network.
cu
- 初学簇时的小vi，输入姓名学号等信息，通过建立的簇进行显示-Vi beginner when small clusters, enter the name of science, and other information, through the establishment of the cluster display
3.3
- Create an input cluster is shown below. Detection input values in a cluster, if greater than or equal to 0, then all of the controls on the input meter cluster Calculate the absolute value contrary, all of the controls on the input c
LabVIEW-Programming-Examples
- This some usefull examples for beginers LabVIEW Programming. This prf file is consists of ten short Chapters: Customising the LabVIEW enviropment, Wires and variables, Strings, Arrays, SubVi-s, Clusters, Formula Node, Debugging, Project Exporer and S
Type-Sensitive-Popup2014-10-21
- 程序功能： 在树形控件、表格控件等中添加各种类型的控件，包括枚举形、颜色控件、字符串控件、数值控件、按钮等，在其中的整型簇上点击，还可以在鼠标旁边出现一个修改值的小型对话框。-Program features: In the tree control, a table to add controls and other types of controls, including enumeration shape, color controls, string control, numerica
yiqunjulei
- 蚁群基本聚类算法，用于数据挖掘领域，可以将相似度高的数据聚为一类。-ant colonyvalgorithm can group similar data objects into the same clusters, and the dissimilar ones into different clusters.
Arrayfenlei
- 根据簇数组中的某一元素，对簇数组中的数据进行分类-According to some element in the array of clusters, cluster array of data classification
zhuanhuan
- 簇和数组的转换，在某些特定环境下，需要簇或者需要数组的时候，可以用此来转换-Conversion of clusters and arrays, in certain circumstances, or when you need an array to cluster, this can be used to convert
kmeans
- Algorithm k-means is a simple iterative clustering algorithm, which divides the set of data to a user-specified number of clusters, k. The algorithm is simple to implement and run relatively fast, easily adaptable and common in practice. It is his
databricks-spark-reference-applications.pdf.tar
- 摘要: 现有的聚类算法比如 CluStream 是基于 k-means 算法的。这些算法不能够发现任 意形状的簇以及不能处理离群点。 解决上述问题,本文提出了 而且, 它需要预先知道 k 值和用户指定的时间窗口。 为了 分将数据映射到一个网格, D-Stream 算法,它是基于密度的算法。这个算法用一个在线部 在离线部分计算网格的密度然后基于密度形成簇。 度衰减技术来捕获数据流的动态变化。 为了探索衰减因子、 数据密度以及簇结构之间的关系, 我们的算法能够有效的并且有效率