Sciweavers

4355 search results - page 661 / 871
» Increasing Kolmogorov Complexity
Sort
View
RTS
2011
123views more  RTS 2011»
15 years 1 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
TCOM
2011
92views more  TCOM 2011»
15 years 1 months ago
Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics
Bit-interleaved coded modulation (BICM) has become the de facto coding standard for communication systems. Recently, BICM has been cast as a mismatched decoding scheme due to the ...
Trung Thanh Nguyen 0001, Lutz H.-J. Lampe
ICASSP
2010
IEEE
15 years 1 months ago
Physical layer algorithm and hardware verification of MIMO relays using cooperative partial detection
Cooperative communication with multi-antenna relays can significantly increase the reliability and speed. However, cooperative MIMO detection would impose considerable complexity o...
Kiarash Amiri, Michael Wu, Melissa Duarte, Joseph ...
IPL
2010
141views more  IPL 2010»
15 years 1 months ago
On the differential and linear efficiency of balanced Feistel networks
Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear c...
Andrey Bogdanov
JAISE
2010
182views Algorithms» more  JAISE 2010»
15 years 1 months ago
Exploring semantics in activity recognition using context lattices
Studying human activities has significant implication in human beneficial applications such as personal healthcare. This research has been facilitated by the development of sensor ...
Juan Ye, Simon Dobson