<ul id="gqw2c"></ul> 自行implement的k-mean(含fuzzy c mean)，可以直接於vc++針對大量數據進行分群的動作
標簽： implement k-mean fuzzy mean
上傳時間： 2017-02-04
上傳用戶：woshini123456
Core Java 2中awt高級特性圖像處理中顯示Mandebrot Set的小例子
上傳時間： 2014-01-06
上傳用戶：chenjjer
This text introduces the spirit and theory of hacking as well as the science behind it all it also provides some core techniques and tricks of hacking so you can think like a hacker, write your own hacks or thwart potential system attacks. 我記得好像的關于緩沖區溢出的
標簽： introduces the hacking science
上傳時間： 2014-08-14
上傳用戶：Breathe0125
基于C++闡述虛擬機編程原理 This guide provides an in-depth look at the construction and underlying theory of a fully functional virtual machine and an entire suite of related development tools.
標簽： construction underlying provides in-depth
上傳時間： 2017-02-12
上傳用戶：nanxia
一個delphi下使用的壓縮組件 TCompress Component Set V8
標簽： TCompress Component delphi Set
上傳時間： 2017-02-13
上傳用戶：大融融rr
A set of C++ and Matlab routines implementing the surfacelet transform surfacelet的一個非常好用的工具箱
標簽： surfacelet implementing transform routines
上傳時間： 2014-01-24
上傳用戶：tyler
這是關于FUZZY 控制的程序，可以下來看看，很少有的，絕對好東西
上傳時間： 2014-01-13
上傳用戶：xhz1993
for binder and can be set as any mode
上傳時間： 2013-12-09
上傳用戶：JIUSHICHEN
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標簽： contains Output convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
Huffman codes In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. This problem can by solved by using an extended binary tree which is used in the 2- way merging problem.
標簽： telecommunication represent messages Huffman
上傳時間： 2014-01-04
上傳用戶：x4587
<ul id="uau2i"></ul> <strike id="uau2i"></strike>