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 matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
标签： implementation double-array representing structure
上传时间： 2013-12-10
上传用户：shinesyh
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 computation efficient EST algorithm is also proposed, which makes the STBC-EST affordable. Simulation results show that the STBC-EST with a modest feedback requirement results in a negligible BER performance loss compared with a dual system configuration.
标签： multiple-input-m eigen-space combined tracking
上传时间： 2014-01-13
上传用户：磊子226
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 5 - 25 FPS limiter on/off * - HUD on/off
标签： water interactive realistic fountain
上传时间： 2013-12-19
上传用户：yuchunhai1990
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 node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
标签： followingconditions tree completely satisfying
上传时间： 2017-05-25
上传用户：2467478207
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 Downstream applications like analysis tools (medical imaging), computer aided manufacturing, or numerical simulations all require high quality polygonal meshes as input. The need to bridge the gap between raw triangle soup data and high-quality polygon meshes has driven the research on ecient data structures and algorithms that directly operate on polygonal meshes rather than on a (most often not feasible) intermediate CAD representation.
标签： processing productive the polygonal
上传时间： 2017-06-03
上传用户：TF2015
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 estimated blocky strength,
标签： transform-domain effectively algorithms Abstract
上传时间： 2017-06-16
上传用户：zukfu
有用的几个动力学物理量。包括自相关函数(acorr.m)，复杂度(complexity.m)，最近邻点(fnn.m)，局部非线性预测误差(nlpe.m，Shannon复杂度（Shannon.m）,嵌入窗估计(window.m)
上传时间： 2014-12-08
上传用户：Breathe0125
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 knowledge of C or any other particular language. It reduces the usually considerable complexity of C++. The included lessons allow you to learn by doing, as a participant of an interactive education session. You’ll master each step in a one sitting before you proceed to the next. Author Ray Lischner has designed questions to promote learning new material. And by responding to questions throughout the text, youll be engaged every step of the way.
标签： Exploring directed lessons series
上传时间： 2014-11-15
上传用户：caiiicc
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 algorithms in a compound system of other information sources such as an electronic chip tray, reduces the vision task to detect cards and chips. Robust results are achieved by not just analyzing single frames but an image stream regarding game-ß ow informations. The requirements for such a system are a highly robust and adaptive behav- ior. This is motivated by the vital interest of casino entrepreneurs in a 100 statistical analysis of their offered gambling in order to support the business plan, measuring table and dealer performance and give accurate player rating. Extensive experiments show the robustness and applicability of the proposed system.
标签： applications vision-based algorithms industrial
上传时间： 2017-08-20
上传用户：liansi
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 generation, support for encapsulation, inheritance, and "the virtuals"-virtual functions and virtual inheritance. This book shows how your understanding the underlying implementation models can help you code more efficiently and with greater confidence. Lippman dispells the misinformation and myths about the overhead and complexity associated with C++, while pointing out areas in which costs and trade offs, sometimes hidden, do exist. He then explains how the various implementation models arose, points out areas in which they are likely to evolve, and why they are what they are. He covers the semantic implications of the C++ object model and how that model affects your programs.
标签： understanding programmer desires fuller
上传时间： 2017-09-25
上传用户：gtzj
