نتایج جستجو برای: Binary Presentation
تعداد نتایج: 279994 فیلتر نتایج به سال:
in this paper, a new method is introduced for improving the efficiency of the residue number system, which uses both binary and residue representations in order to represent a number. a residue number system uses the remainder of the division in several different modules. conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...
this experimental study has been conducted to test the effect of oral presentation on the development of l2 learners grammar. but this oral presentation is not merely a deductive instruction of grammatical points, in this presentation two hypotheses of krashen (input and low filter hypotheses), stevicks viewpoints on grammar explanation and correction and widdowsons opinion on limited use of l1...
In this article we discuss the presentation of a random binary matrix using sequence of whole nonnegative numbers. We examine some advantages and disadvantages of this presentation as an alternative of the standard presentation using two-dimensional array. It is shown that the presentation of binary matrices using ordered n-tuples of natural numbers makes the algorithms faster and saves a lot o...
abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...
SWRL rules are transformed in two steps for visualization in a subset of Grailog. A Unary/Binary Datalog rule in SWRL presentation syntax is translated to a corresponding PSOA RuleML rule in a RIF-like presentation syntax employing frame formulas. This is then translated to the Graphviz DOT language so that the Graphviz tool can render it visually as a Grailog graph with an object identifier an...
An optimal binary search tree is a binary search tree for which the nodes are arranged on levels such that the tree cost is minimum. For the purpose of a better presentation of optimal binary search trees, we will consider “extended binary search trees”, which have the keys stored at their internal nodes. Suppose “n” keys k1, k2, ... , k n are stored at the internal nodes of a binary search tre...
This article reports on the use of Hidden Markov Models to improve the results of Localization within a sequence of Sensor Views. Local image features (SIFT) and multiple types of features from a 2D laser range scan are all converted into binary form and integrated into a single, binary, Feature Incidence Matrix (FIM). To reduce the large dimensionality of the binary data, it is modeled in term...
In this paper, a new method is introduced for improving the efficiency of the Residue Number System, which uses both binary and residue representations in order to represent a number. A residue number system uses the remainder of the division in several different modules. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید