CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - hash
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - hash - List
[
TreeView
]
2004052512573625343213132123
DL : 0
1)了解HASH函数在网络安全中的应用 (2)掌握HASH函数实现的原理 二、要求 (1)用任何语言编程完成实现HASH函数的功能 (2)输入任何8个字节(64位)的数据,得出对应的8位HASH代码(摘要) -1) understanding hash functions in network security applications (2) master Hash Function Principle 2 require (1) using any programming language to achieve complete hash of functionality (2) the importation of any eight-byte (64 spaces) data, draw the corresponding eight hash code (Abstract)
Date
: 2008-10-13
Size
: 817.64kb
User
:
dreamwhere
[
TreeView
]
PrtTView_demo
DL : 0
This project is to show the tree I dreamed when I first met the ternary tree concept. When I came upon the ternary tree, I get awed! It s amazing that an idea so simplistic could be so strong and fast. But it had flaws... the first one is the memory consumption. The hash table implementation consumes far less memory than the ternary tree! The second flaw is the ternary tree can be fragmented and be extremely unbalanced (as the algorithm doesn t do any balancing step) so the tree also needs a way for balancing the nodes. I tried to reduce the memory consumption by grouping three nodes into one new \"int\" node. -This project is to show the tree I dreamed wh en I first met the ternary tree concept. When I ca me upon the ternary tree, I get awed! It's amazing that an idea so simplisti c could be so strong and fast. But it had flaws ... the first one is the memory consumption. The has h table implementation consumes far less memor y than the ternary tree! The second flaw is the te rnary tree can be fragmented and be extremely un balanced (as the algorithm does not do any balanc ing step) so the tree also needs a way for balanci Vi the nodes. I tried to reduce the memory consum ption by grouping three nodes into one new "int" node.
Date
: 2008-10-13
Size
: 31.53kb
User
:
gaowen
[
TreeView
]
2004052512573625343213132123
DL : 0
1)了解HASH函数在网络安全中的应用 (2)掌握HASH函数实现的原理 二、要求 (1)用任何语言编程完成实现HASH函数的功能 (2)输入任何8个字节(64位)的数据,得出对应的8位HASH代码(摘要) -1) understanding hash functions in network security applications (2) master Hash Function Principle 2 require (1) using any programming language to achieve complete hash of functionality (2) the importation of any eight-byte (64 spaces) data, draw the corresponding eight hash code (Abstract)
Date
: 2025-12-30
Size
: 817kb
User
:
[
TreeView
]
PrtTView_demo
DL : 0
This project is to show the tree I dreamed when I first met the ternary tree concept. When I came upon the ternary tree, I get awed! It s amazing that an idea so simplistic could be so strong and fast. But it had flaws... the first one is the memory consumption. The hash table implementation consumes far less memory than the ternary tree! The second flaw is the ternary tree can be fragmented and be extremely unbalanced (as the algorithm doesn t do any balancing step) so the tree also needs a way for balancing the nodes. I tried to reduce the memory consumption by grouping three nodes into one new "int" node. -This project is to show the tree I dreamed wh en I first met the ternary tree concept. When I ca me upon the ternary tree, I get awed! It's amazing that an idea so simplisti c could be so strong and fast. But it had flaws ... the first one is the memory consumption. The has h table implementation consumes far less memor y than the ternary tree! The second flaw is the te rnary tree can be fragmented and be extremely un balanced (as the algorithm does not do any balanc ing step) so the tree also needs a way for balanci Vi the nodes. I tried to reduce the memory consum ption by grouping three nodes into one new "int" node.
Date
: 2025-12-30
Size
: 31kb
User
:
gaowen
[
TreeView
]
01530332
DL : 0
音频哈希的论文可以用来音频检索 音频认证 很好的 -Audio hash papers can be used to retrieve audio audio certification good
Date
: 2025-12-30
Size
: 273kb
User
:
19831024
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.