The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes an approach based on graph isomorphism to find the correspondence in relational matching. We describe a pseudo-automorphism group as Pseudo-aut (G) of a graph G, which is a set of all pseudo-automorphisms of G. We discuss some properties of the Pseudo-aut(Cn) and the relationships between various elements, establish the relationship between the pseudo-isomorphic and the perfect...
This paper presents the probabilistic logic model to compute the probability distribution of the nano gate states. The characterization is based on the Markov random field and statistic physics. The primary logic gates are probabilistically characterized. The effectiveness of the method is demonstrated by a full adder and an 8-bit adder. The analysis shows that the device probability distribution...
A novel method for turning an image into simple line drawings is presented. Our technique consists of three parts: line extraction, line rendering and style translation. First it proposes a novel line extraction method based on mathematical morphology thinning and assembles the discrete pixels into stroke paths. Then it considers the feature scale with which the level-of-detail of lines is controlled...
Let Mq(n) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q-element field by means of bilinear algorithms. It is shown that Mq(n) ≥ 3n - o(n). In particular, if q/2 ≪ n ≤ q + 1, we establish the tight bound Mq(n) = 3n + 1 - ⌊q/2⌋. The technique we use can be applied to analysis of algorithms for multiplication of polynomials...
In an earlier paper [1], the author showed that certain problems involving sparse polynomials and integers are NP-hard. In this paper we show that many related problems are also NP-hard. In addition, we exhibit some new NP-complete problems. Most of the new results concern problems in which the nondeterminism is "hidden". That is, the problems are not explicitly stated in terms of one of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.