Displaying similar documents to “Existence of n -factors in powers of connected graphs”

Local Principal Components Analysis.

Tomàs. Aluja Banet, Ramón Nonell Torrent (1991)

Qüestiió

Similarity:

Principal Components Analysis deals mainly with the analysis of large data sets with multivariate structure in an observational context for exploraty purposes. The factorial planes produced will show the main oppositions between variables and individuals. However, we may be interested in going further by controlling the effect of some latent or third variable which expresses some well-defined phenomenon. We go through this by means of a graph among individuals, following the same idea...

Conceptual Information Compression and Efficient Pattern Search

Angelova, Galia, Mihov, Stoyan (2008)

Serdica Journal of Computing

Similarity:

This paper introduces an encoding of knowledge representation statements as regular languages and proposes a two-phase approach to processing of explicitly declared conceptual information. The idea is presented for the simple conceptual graphs where conceptual pattern search is implemented by the so called projection operation. Projection calculations are organised into off-line preprocessing and run-time computations. This enables fast run-time treatment of NP-complete problems, given...

Synthesis of finite state machines for CPLDs

Robert Czerwiński, Dariusz Kania (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented...

Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16

Stoichev, Stoicho (2007)

Serdica Journal of Computing

Similarity:

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006. Two heuristic algorithms (M65 and M52) for finding respectively unitals and maximal arcs in projective planes of order 16 are described. The exact algorithms based on exhaustive search are impractical because of the combinatorial explosion (huge number of combinations to be checked). Algorithms M65 and...