915 search results - page 12 / 183 » Maximally Abstract Retrenchments |
100
click to vote
LION
2007
Springer
15 years 5 months ago
2007
Springer
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...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
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...
AUSAI
2005
Springer
15 years 5 months ago
2005
Springer
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 ...
90
Voted
GBRPR
2003
Springer
15 years 5 months ago
2003
Springer
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 ...
IEICET
2006
14 years 11 months ago
2006
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...