Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Abstract— In this paper, we analyze the throughput of interconnection networks, viewed as multi-stage queueing networks with infinite input queues, but finite internal cross-st...
Abstract. This note describes a method for computation of non-redundant bases of attribute implications from data tables with fuzzy attributes. Attribute implications are formulas ...
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
Abstract. This paper discusses the state-of-the-art software optimization methodology for symmetric cryptographic primitives on Pentium III and 4 processors. We aim at maximizing s...