This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C++ 6 on a Windows 2000 platform.
標(biāo)簽： L. Professor algorithm developed
上傳時(shí)間： 2014-12-21
上傳用戶(hù)：gonuiln
This directory contains code implementing the K-means algorithm. Source codemay be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANSprogram accepts input consisting of vectors and calculates the givennumber of cluster centers using the K-means algorithm. Output isdirected to the screen.
標(biāo)簽： implementing directory algorithm contains
上傳時(shí)間： 2014-01-27
上傳用戶(hù)：maizezhen
亞定方程組求解：If serial correlation is found, you may have misspecified your model and should return to your theory for a better representation of the data generating process. This possibility is quite likely and should be taken seriously.
標(biāo)簽： misspecified correlation serial return
上傳時(shí)間： 2015-06-16
上傳用戶(hù)：熊少鋒
Programmed for Atmel STK-500 development board, detalis can be found at http://www.cs.hut.fi/Studies/T-106.5300/2007/stk500.html
標(biāo)簽： development Programmed Studies detalis
上傳時(shí)間： 2013-12-18
上傳用戶(hù)：waitingfy
This code in this directory implements the binary hopfield network. Source code may be found in HOPNET.CPP. A sample training file is H7x8N4.trn. Sample test pattern files are: H7x8D4.TST, H5x8D7.TST, H5x8D7.TST and H5x8D9.TST, Output of the program goes to both the screen and a file, ARCHIVE.LST.
標(biāo)簽： code implements directory hopfield
上傳時(shí)間： 2014-01-16
上傳用戶(hù)：123啊
Did anyone ask for an integer version of sqrt? Following is an implementation I found and adapted. Hope it is useful for somebody.
標(biāo)簽： implementation Following adapted integer
上傳時(shí)間： 2013-12-24
上傳用戶(hù)：阿四AIR
To date tests are still the best solution mankind has found to deliver working software. This book is the sum of four years of research and practice in the testing field. The practice comes from my IT consulting background, first at Octo Technology and then at Pivolis the research comes from my involvement with open source development at night and on weekends.
標(biāo)簽： solution software mankind deliver
上傳時(shí)間： 2014-01-11
上傳用戶(hù)：sclyutian
This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
標(biāo)簽： code implementing directory algorithm
上傳時(shí)間： 2014-01-15
上傳用戶(hù)：woshini123456
An object based tree widget, emulating the one found in microsoft windows, | | with persistence using cookies. Works in IE 5+, Mozilla and konqueror 3.
標(biāo)簽： persistence emulating microsoft windows
上傳時(shí)間： 2016-01-30
上傳用戶(hù)：qiao8960
The last step in training phase is refinement of the clusters found above. Although DynamicClustering counters all the basic k-means disadvantages, setting the intra-cluster similarity r may require experimentation. Also, a cluster may have a lot in common with another, i.e., sequences assigned to it are as close to it as they are to another cluster. There may also be denser sub-clusters within the larger ones.
標(biāo)簽： DynamicClusteri refinement Although clusters
上傳時(shí)間： 2014-01-04
上傳用戶(hù)：watch100
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
