Sciweavers

915 search results - page 12 / 183
» Maximally Abstract Retrenchments
Sort
View
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 2 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
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...
Samuel Rota Bulò, Marcello Pelillo
GLOBECOM
2006
IEEE
14 years 2 months ago
Capacity Maximizing Packet Scheduling Algorithms for Interconnection Networks with Finite Buffers
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...
Kevin Ross, Nicholas Bambos
AUSAI
2005
Springer
14 years 1 months ago
Fuzzy Attribute Implications: Computing Non-redundant Bases Using Maximal Independent Sets
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 ...
Radim Belohlávek, Vilém Vychodil
GBRPR
2003
Springer
14 years 1 months ago
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set
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 ...
Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch
IEICET
2006
84views more  IEICET 2006»
13 years 8 months ago
How to Maximize Software Performance of Symmetric Primitives on Pentium III and 4
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...
Mitsuru Matsui, Sayaka Fukuda