CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - Tree
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - Tree - List
[
Software Engineering
]
构建FP-Tree的详细图解教程
DL : 0
构建FP-Tree的详细图解教程以及算法具体实现的分析
Date
: 2011-07-21
Size
: 386.18kb
User
:
javafun
[
Software Engineering
]
HnSRTree-1.3.1.tar
DL : 0
R 树, 存取方式的当中最普遍的的用长方形, 是根据区域的启发式优化围绕的长方形在各个内在结点通过运行在一张规范化的试验平台下高度变化的数据, 询问和操作众多的实验, 我们能设计合并联合的优化的R* 树区域, 各个附寄的长方形边际和交叠在目录使用我们规范化的试验床在详尽表现比较,它结果R* 树清楚地胜过现有的R 树变形Guttman’s线性和二次方R 树和R 树的格林变形,R* 树的这优势举行为不同的型询问和操作, 譬如地图覆盖物。 为两个长方形和多维点在所有实验从一个实用观点R* 树是非常有吸引力的由于以下二个原因1 它高效率地支持点和空间数据同时和2 它实施费用比那少许高级其它R 树。-R tree, which forms of access to the most common use of a rectangular shape, which is based on heuristic optimization rectangular inherent in all nodes running on a standardized test platform height data, inquiries and the operation of many experiments, we can design the optimal merging of the joint R* Tree region, judging from the various and overlapping rectangular marginal in the directory using our standardized test bed in a detailed performance comparisons, and it results R* tree clearly better than the existing R-tree deformation Guttman's linear and quadratic R-tree and R Green Tree deformation, R* Tree of this advantage at different type of inquiry and operation, such as maps cover. For two and multi-dimensional rectangular in all experiments from a practical point of R* tr
Date
: 2025-12-19
Size
: 168kb
User
:
王琪
[
Software Engineering
]
DecisionTreeApplet_3.20
DL : 0
一个决策树的Applet(转载,内有说明)-a Decision Tree Applet (reproduced, which is described)
Date
: 2025-12-19
Size
: 377kb
User
:
钱晨
[
Software Engineering
]
design-flow-speeding-up-dsp
DL : 0
Wavelets have widely been used in many signal and image processing applications. In this paper, a new serial-parallel architecture for wavelet-based image compression is introduced. It is based on a 4-tap wavelet transform, which is realised using some FIFO memory modules implementing a pixel-level pipeline architecture to compress and decompress images. The real filter calculation over 4 · 4 window blocks is done using a tree of carry save adders to ensure the high speed processing required for many applications. The details of implementing both compressor and decompressor sub-systems are given. The primarily analysis reveals that the proposed architecture, implemented using current VLSI technologies, can process a video stream in real time.-Wavelets have been widely used in many sign al and image processing applications. In this p aper. a new serial-parallel architecture for wavele t-based image compression is introduced. It is based on a 4-tap wavelet transform. which is realized using some FIFO memory module 's implementing a pixel-level pipeline archite cture to compress and decompress images. The're al filter calculation over 4 blocks window is done using a tree of carry save adders to ensure t he high speed processing required for many appl ications. The details of implementing both com pressor decompressor and sub-systems are give n. The primarily analysis reveals that the prop osed architecture, VLSI implemented using current technologies, can process a video stream in real time.
Date
: 2025-12-19
Size
: 2.71mb
User
:
sdfafaf
[
Software Engineering
]
2-3-trees
DL : 0
It s a note about data structure. Tree---self balancing and rotate-It's a note about data structure. Tree--- se lf balancing and rotate
Date
: 2025-12-19
Size
: 78kb
User
:
Benny Van
[
Software Engineering
]
AVLTrees
DL : 0
It s a note on data structure---AVL tree, very clear and useful!-It's a note on data structure-- AVL tree, very clear and useful!
Date
: 2025-12-19
Size
: 165kb
User
:
Benny Van
[
Software Engineering
]
shujujiegou-erchashu
DL : 0
叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T; (2)对二叉排序树T作中序遍历,输出结果; (3)计算二叉排序树T的平均查找长度,输出结果; (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2);否则输出信息“无结点x”; (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK!”/“NO!”;-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ;
Date
: 2025-12-19
Size
: 2kb
User
:
胡图
[
Software Engineering
]
tree1-1
DL : 0
关于编辑vb树形结构的vb源代码,大家可以随意下载,欢迎提供意见。-editorial on the tree structure vb vb source code, you can download free, welcomed the comments.
Date
: 2025-12-19
Size
: 1kb
User
:
mjjun
[
Software Engineering
]
suffixtree
DL : 0
中科院计算所的关于后缀树的一个ppt,内容是英文的-calculation of the Chinese Academy of Sciences on a suffix tree ppt, as is the English
Date
: 2025-12-19
Size
: 26kb
User
:
陈颍
[
Software Engineering
]
tree
DL : 0
数据结构中树以及二叉树的基本操作以及算法,构造哈夫曼树以及模拟,带FLASH演示-Tree data structure and basic operations as well as the binary tree algorithm, Huffman tree structure, as well as simulation, with FLASH demo
Date
: 2025-12-19
Size
: 314kb
User
:
nlx
[
Software Engineering
]
TreeListRecursion
DL : 0
This article is a tree list recursion. -This article is a tree list recursion.
Date
: 2025-12-19
Size
: 32kb
User
:
zhb
[
Software Engineering
]
tree
DL : 0
二叉树的搜索,以及添加,删除,排序等共能的实现-Binary tree search, as well as add, delete, sort, were able to realize the
Date
: 2025-12-19
Size
: 2kb
User
:
李白
[
Software Engineering
]
kd-trees
DL : 0
数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构:线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
Date
: 2025-12-19
Size
: 304kb
User
:
henry
[
Software Engineering
]
STEINER_MINIMAL_TREES_FOR_ZIGZAG_LINES_WITH_LADDER
DL : 0
steiner tree工具,利用率挺高的,计算minial steiner tree时候可以看看 -steiner tree tools, utilization of挺高calculated when minial steiner tree can look at
Date
: 2025-12-19
Size
: 133kb
User
:
wy
[
Software Engineering
]
MinimumSpanningTree
DL : 0
simulation of spanning tree algorithm
Date
: 2025-12-19
Size
: 327kb
User
:
prindi
[
Software Engineering
]
tree
DL : 0
二叉树的创建、递归遍历算法及其它基本操作的实现-The creation of a binary tree, recursive traversal algorithm and the realization of other basic operations
Date
: 2025-12-19
Size
: 5kb
User
:
房春英
[
Software Engineering
]
Rtree
DL : 0
R树,一个用于空间查询的动态索引结构。能够更有效地处理空间数据点-R tree, a query for a dynamic index structure of space. To more effectively deal with spatial data points
Date
: 2025-12-19
Size
: 220kb
User
:
刘国慧
[
Software Engineering
]
TREE
DL : 0
js自定义 tree , js自定义 tree -s d d s satgdasg asg sdf gs f
Date
: 2025-12-19
Size
: 643kb
User
:
lianghuiqing
[
Software Engineering
]
MPLS-based-source-tree-multicast-algorithm-for-min
DL : 0
基于源树的MPLS最小冲突路径多播算法MPLS-based source tree multicast algorithm for minimum path conflict-MPLS-based source tree multicast algorithm for minimum path conflict
Date
: 2025-12-19
Size
: 73kb
User
:
renww11
[
Software Engineering
]
B-tree.pdf
DL : 0
A document about b tree
Date
: 2025-12-19
Size
: 230kb
User
:
zxw199668
«
1
2
3
4
5
6
7
8
9
10
...
17
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.