Sciweavers

2296 search results - page 54 / 460
» The Expressive Power of Synchronizations
Sort
View
CODES
2010
IEEE
15 years 2 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
TSP
2010
14 years 10 months ago
Uplink synchronization in OFDMA spectrum-sharing systems
Spectrum sharing employs dynamic allocation of frequency resources for a more efficient use of the radio spectrum. Despite its appealing features, this technology inevitably compli...
Luca Sanguinetti, Michele Morelli, H. Vincent Poor
CSL
2007
Springer
15 years 10 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk
VTC
2007
IEEE
146views Communications» more  VTC 2007»
15 years 10 months ago
Orthogonal STBC in General Nakagami-m Fading Channels: BER Analysis and Optimal Power Allocation
Abstract— We analyze the performance of multiple-input multiple-output (MIMO) systems employing orthogonal space-time block codes (STBC) in general Nakagami-m fading channels wit...
Andreas Müller, Joachim Speidel
JACM
2002
142views more  JACM 2002»
15 years 3 months ago
Timed regular expressions
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
Eugene Asarin, Paul Caspi, Oded Maler