نتایج جستجو برای: is descriptive
تعداد نتایج: 7270750 فیلتر نتایج به سال:
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
growing demands and requires of high data rate systems cause significant increase of high frequency systems for wideband communication applications. as mixers are one of the main blocks of each receivers and its performance has great impact on receiver’s performance; in this thesis, a new solution for ku-band (12-18 ghz) mixer design in tsmc 0.18 µm is presented. this mixer has high linearity a...
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 ...
Context-free tree grammars, originally introduced by Rounds ((Rounds, 1970)), are powerful grammar devices for the definition of tree languages. In the present paper, we consider a subclass of the class of context-free tree languages, namely the class of monadic simple context-free tree languages. For this class of context-free tree languages, a faithful rendering of extended TAGs, we show that...
Acknowledgements : many thanks to professor Giovanni Pighizzini for its welcome and for having directed my internship. Many thanks also to Carlo Mereghetti and Beatrice Palano and all organizing committee of NCMA workshop for having given me the possibility to assist at this workshop. Many thanks also to Viliam Geffert for his contribution to our work. Thanks to Antonio Capoduro for coffees and...
For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so called t-mode of derivation) are treated with respect to the...
In a designated verifier signature (DVS) scheme a signer creates a signature which is only verifiable by a designated verifier. A DVS is a useful scheme for authenticating a signer without disturbing her privacy. In a universal DVS (UDVS) scheme, everyone who holds Alice’s traditional signature on a message (the signature holder), is able to transform it to a DVS for a specific verifier. Non-de...
Decision tree pruning is critical for the construction of good decision trees. The most popular and widely used method among various pruning methods is cost-complexity pruning, whose implementation requires a training dataset to develop a full tree and a validation dataset to prune the tree. However, different pruned trees are found to be produced when the original dataset are randomly partitio...
My research interests involve Finite Model Theory and Descriptive Complexity, an area of research nestled in the intersection of Combinatorics, Logic and Computer Science. Inspired by Ehrenfeucht–Fräıssé games, I have been studying local properties of regular colored graphs– in particular, the computational complexity of realizing a given set of neighborhoods in a graph.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید