涩涩视频在线播放,78色国产精品,亚洲欧美日韩综合aⅴ视频

trees

using decision trees in NIDS

using decision trees in NIDS

標(biāo)簽： decision using trees NIDS

上傳時(shí)間： 2013-12-01

上傳用戶：zmy123
Code examples in Java about functions, trees, graphs and abstracts data types.

Code examples in Java about functions, trees, graphs and abstracts data types.

標(biāo)簽： abstracts functions examples graphs

上傳時(shí)間： 2014-01-02

上傳用戶：lanjisu111
its a demonstration of trees being emerging.... they appear like christmas tress

its a demonstration of trees being emerging.... they appear like christmas tress

標(biāo)簽： demonstration christmas emerging appear

上傳時(shí)間： 2014-11-27

上傳用戶：qiao8960
The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of cla

The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of classified examples a decision tree is induced, biased by the information gain measure, which heuristically leads to small trees. The examples are given in attribute-value representation. The set of possible classes is finite. Only tests, that split the set of instances of the underlying example languages depending on the value of a single attribute are supported.

標(biāo)簽： algorithm induction decision top-down

上傳時(shí)間： 2017-08-20

上傳用戶：hzy5825468
Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures trees Binary Tree S

Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures trees Binary Tree Searching and Sorting AVL Tree Red-Black Tree

標(biāo)簽： Linked Datastructure Multi-lists Structures

上傳時(shí)間： 2014-05-31

上傳用戶：xmsmh
It s an interface for using huffman trees (data structure application) that can be used for compress

It s an interface for using huffman trees (data structure application) that can be used for compression and a test program with CLI in a form of a menu to test those features.

標(biāo)簽： application interface for structure

上傳時(shí)間： 2014-01-20

上傳用戶：wanghui2438
基于FPGA的靜止圖像編碼器

遙感圖像在人類生活和軍事領(lǐng)域的應(yīng)用日益廣泛，適合各種要求的遙感圖像編碼技術(shù)具有重要的現(xiàn)實(shí)意義。基于小波變換的內(nèi)嵌編碼技術(shù)已成為當(dāng)前靜止圖像編碼領(lǐng)域的主流，其中就包括基于分層樹(shù)集合分割排序(Set Partitioning inHierarchical trees，SPIHT)的內(nèi)嵌編碼算法。這種算法具有碼流可隨機(jī)獲取以及良好的恢復(fù)圖像質(zhì)量等特性，因此成為實(shí)際應(yīng)用中首選算法。隨著對(duì)圖像編碼技術(shù)需求的不斷增長(zhǎng)，尤其是在軍事應(yīng)用領(lǐng)域如衛(wèi)星偵察等方面，這種編碼算法亟待轉(zhuǎn)換為可應(yīng)用的硬件編碼器。在靜止圖像編碼領(lǐng)域，高性能的圖像編碼器設(shè)計(jì)一直是相關(guān)研究人員不懈追求的目標(biāo)。本文針對(duì)靜止圖像編碼器的設(shè)計(jì)作了深入研究，并致力于高性能的圖像編碼算法實(shí)現(xiàn)結(jié)構(gòu)的研究，提出了具有創(chuàng)新性的降低計(jì)算量、存儲(chǔ)量，提高壓縮性能的算法實(shí)現(xiàn)結(jié)構(gòu)，并成功應(yīng)用于圖像編碼硬件系統(tǒng)中。這個(gè)方案還支持壓縮比在線可調(diào)，即在不改變硬件框架的條件下可按用戶要求實(shí)現(xiàn)16倍到2倍的壓縮，以適應(yīng)不同的應(yīng)用需求。本文所做的工作包括了兩個(gè)部分。 1．一種基于行的實(shí)時(shí)提升小波變換實(shí)現(xiàn)結(jié)構(gòu)：該結(jié)構(gòu)同時(shí)處理行變換和列變換，并且在圖像邊界采用對(duì)稱擴(kuò)展輸出邊界數(shù)據(jù)，使得圖像小波變換時(shí)間與傳統(tǒng)的小波變換相比提高了將近2.6倍，提高了硬件系統(tǒng)的實(shí)時(shí)性。該結(jié)構(gòu)還合理地利用和調(diào)度內(nèi)部緩沖器，不需要外部緩沖器，大大降低了硬件系統(tǒng)對(duì)存儲(chǔ)器的要求。 2．一種采用左遍歷的比特平面并行SPIHT編碼結(jié)構(gòu)：在該編碼結(jié)構(gòu)中，空間定位生成樹(shù)采用深度優(yōu)先遍歷方式，比特平面同時(shí)處理極大地提高了編碼速度。

標(biāo)簽： FPGA 圖像編碼器

上傳時(shí)間： 2013-06-17

上傳用戶：abc123456.
排序算法、字典和B-樹(shù)的C++語(yǔ)言實(shí)現(xiàn) 代碼內(nèi)容包括以下算法： qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert

排序算法、字典和B-樹(shù)的C++語(yǔ)言實(shí)現(xiàn) 代碼內(nèi)容包括以下算法： qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert sort shl.c sort: shell sort has.c dictionary: hash tables bin.c dictionary: binary tree rbt.c dictionary: red-black trees skl.c dictionary: skip lists ext.c external sort btr.c btree 語(yǔ)言 C++ 編譯平臺(tái) Visual C++ 作者 Thomas Niemann 備注來(lái)自Sorting and Searching Algorithms:A Cookbook

標(biāo)簽： sort qsort quicksort insert

上傳時(shí)間： 2013-12-15

上傳用戶：silenthink
The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pasca

The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pascal to implement Splay trees. This program compresses and decompresses files, and does a pretty good job of it. Contents: SPLAY.PAS Original TP source code SPLAY.C Translation of code to C SPLAY.EXE Compiled version of SPLAY.C (small model) README.DOC You are looking at it Read the comments at the beginning of SPLAY.C for more info.

標(biāo)簽： program translation Kokkonen pascal

上傳時(shí)間： 2015-05-05

上傳用戶：rocwangdp
DES,MD5,ZLIB算法源代碼文件列表： Adler32.cpp ArithDLL.cpp ArithDLL.def ArithDLL.dll ArithDLL.dsp Arith

DES,MD5,ZLIB算法源代碼文件列表： Adler32.cpp ArithDLL.cpp ArithDLL.def ArithDLL.dll ArithDLL.dsp ArithDLL.dsw ArithDLL.h ArithDLL.lib ArithDLL.ncb ArithDLL.opt ArithDLL.plg Arithzxz.h Arithzxz.h.BAK Compress.cpp CRC.cpp Deflate.cpp Deflate.h Des.cpp Des.h Infblock.cpp Infblock.h Infcodes.cpp Infcodes.h Inffast.cpp Inffast.h Inffixed.h Inflate.cpp Inftrees.cpp Inftrees.h Infutil.cpp Infutil.h md5.cpp md5.h ReadMe.txt StdAfx.cpp StdAfx.h String.cpp trees.cpp Zlib.h Zutil.cpp Zutil.h

標(biāo)簽： ArithDLL cpp Adler Arith

上傳時(shí)間： 2014-11-23

上傳用戶：bibirnovis

亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

trees

using decision trees in NIDS

Code examples in Java about functions, trees, graphs and abstracts data types.

its a demonstration of trees being emerging.... they appear like christmas tress

The algorithm ID3 (Quinlan) uses the method top-down induction of decision trees. Given a set of cla

Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures trees Binary Tree S

It s an interface for using huffman trees (data structure application) that can be used for compress

基于FPGA的靜止圖像編碼器

排序算法、字典和B-樹(shù)的C++語(yǔ)言實(shí)現(xiàn) 代碼內(nèi)容包括以下算法： qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert

The program SPLAY is a pascal to C translation of a program that Kim Kokkonen wrote in Turbo Pasca

DES,MD5,ZLIB算法源代碼文件列表： Adler32.cpp ArithDLL.cpp ArithDLL.def ArithDLL.dll ArithDLL.dsp Arith