搜索结果
找到约 82 项符合
ow-complexity 的查询结果
数据结构 This is an implementation of double-array structure for representing trie, as proposed by Junichi A
This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe [1].
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental m ...
电子书籍 A combined space鈥搕ime block coding (STBC) and eigen-space tracking (EST) scheme in multiple-input-m
A combined space鈥搕ime block coding (STBC) and eigen-space tracking
(EST) scheme in multiple-input-multiple-output systems is
proposed. It is proved that the STBC-EST is capable of shifting
hardware complexity from the receiver to the transmitter without
any bit error rate (BER) performance loss. A ...
游戏 An interactive water fountain. A realistic water source in your pocket with full control. Contro
An interactive water fountain.
A realistic water source in your pocket with full control.
Controls:
UP/DOWN - go closer/further
LEFT/RIGHT - rotate
# - stop rotation
1/7 - rotate camera up/down
3/9 - change water pressure
4/6 - change water rendering complexity
2/8 - ascend/descend
0 - bullet time ...
人工智能/神经网络 Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely ba
Heapsort
1.A heap is a binary tree satisfying the followingconditions:
-This tree is completely balanced.
-If the height of this binary tree is h, then leaves can be at level h or level h-1.
-All leaves at level h are as far to the left as possible.
-The data associated with all descendants of a nod ...
行业发展研究 In the last decade the processing of polygonal meshes has emerged as an active and very productive
In the last decade the processing of polygonal meshes has
emerged as an active and very productive research area. This
can basically be attributed to two developments:
Modern geometry acquisition devices, like laser scanners
and MRT, easily produce raw polygonal meshes of
ever growing complexity
D ...
其他书籍 Abstract—In this paper, we propose transform-domain algorithms to effectively classify the characte
Abstract—In this paper, we propose transform-domain algorithms to
effectively classify the characteristics of blocks and estimate the strength
of the blocky effect. The transform-domain algorithms require much
lower computational complexity and much less memory than the spatial
ones. Along with the ...
matlab例程 有用的几个动力学物理量。包括自相关函数(acorr.m)
有用的几个动力学物理量。包括自相关函数(acorr.m),复杂度(complexity.m),最近邻点(fnn.m),局部非线性预测误差(nlpe.m,Shannon复杂度(Shannon.m),嵌入窗估计(window.m)
Java编程 Exploring C++ uses a series of self–directed lessons to divide C++ into bite–sized chunks that you c
Exploring C++ uses a series of self–directed lessons to divide C++ into bite–sized chunks that you can digest as rapidly as you can swallow them. The book assumes only a basic understanding of fundamental programming concepts (variables, functions, expressions, statements) and requires no prior kn ...
嵌入式/单片机编程 The potential of solving real-time demanding industrial applications, using vision-based algorithms
The potential of solving real-time demanding industrial applications, using vision-based
algorithms, drastically grew due to an increasing availability of computational power.
In this thesis a novel real-time, vision-based Blackjack analysis system is presented. The
embedding of the vision algorithm ...
VC书籍 If you are a C++ programmer who desires a fuller understanding of what is going on "under the hood,"
If you are a C++ programmer who desires a fuller understanding of what is going on "under the hood," then Inside the C++ Object Model is for you!
Inside the C++ Object Model focuses on the underlying mechanisms that support object-oriented programming within C++: constructor semantics, temporary ge ...