Sciweavers

2629 search results - page 20 / 526
» complex 2009
Sort
View
CEC
2009
IEEE
14 years 4 months ago
Rigorous time complexity analysis of Univariate Marginal Distribution Algorithm with margins
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
ICASSP
2009
IEEE
14 years 4 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
Boris Mailhé, Rémi Gribonval, Fr&eac...
IEEEICCI
2009
IEEE
14 years 4 months ago
Reducing the cognitive complexity of business process models
Current research on the quality of business process models mostly discusses the quality of a model mainly in terms of correctness of its behaviour. In this paper, we discuss anoth...
Volker Gruhn, Ralf Laue
ENDM
2010
87views more  ENDM 2010»
13 years 10 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
DLT
2009
13 years 7 months ago
On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...
Aleksi Saarela