Sciweavers

13977 search results - page 344 / 2796
» Evolution in complex systems
Sort
View
CC
2005
Springer
118views System Software» more  CC 2005»
15 years 6 months ago
The complexity of constructing pseudorandom generators from hard functions
We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0, 1}l...
Emanuele Viola
SIAMSC
2008
142views more  SIAMSC 2008»
15 years 5 months ago
Algebraic Multigrid Solvers for Complex-Valued Matrices
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
Scott MacLachlan, Cornelis W. Oosterlee
TCOM
2010
133views more  TCOM 2010»
15 years 1 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
131
Voted
DATE
2005
IEEE
99views Hardware» more  DATE 2005»
16 years 12 days ago
UML 2 and SysML: An Approach to Deal with Complexity in SoC/NoC Design
UML is gaining increased attention as a system design language, as indicated by current standardization activities such as the SysML initiative and the UML for SoC Forum. Moreover...
Yves Vanderperren, Wim Dehaene
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
15 years 11 months ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney