Sciweavers

539 search results - page 22 / 108
» Linear complexity of transformed sequences
Sort
View
HYBRID
2000
Springer
15 years 1 months ago
Towards Procedures for Systematically Deriving Hybrid Models of Complex Systems
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
Pieter J. Mosterman, Gautam Biswas
80
Voted
JSAC
2007
86views more  JSAC 2007»
14 years 9 months ago
Asymptotically optimal cooperative wireless networks with reduced signaling complexity
Abstract— This paper considers an orthogonal amplify-andforward (OAF) protocol for cooperative relay communication over Rayleigh-fading channels in which the intermediate relays ...
Petros Elia, Frédérique E. Oggier, P...
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
15 years 3 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
FSE
2006
Springer
99views Cryptology» more  FSE 2006»
15 years 1 months ago
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
The main application of stream ciphers is online-encryption of arbitrarily long data, for example when transmitting speech data between a Bluetooth headset and a mobile GSM phone o...
Matthias Krause, Dirk Stegemann
ARTS
1999
Springer
15 years 1 months ago
A Formal Model of Real-Time Program Compilation
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
Karl Lermer, Colin J. Fidge