Sciweavers

530 search results - page 32 / 106
» Universal randomized switching
Sort
View
VTC
2008
IEEE
156views Communications» more  VTC 2008»
15 years 10 months ago
Channel Asymmetry and Random Time Slot Hopping in OFDMA-TDD Cellular Networks
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
Ellina Foutekova, Patrick Agyapong, Harald Haas
AHS
2006
IEEE
125views Hardware» more  AHS 2006»
15 years 10 months ago
Evolving Hardware with Self-reconfigurable connectivity in Xilinx FPGAs
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
Andres Upegui, Eduardo Sanchez
ATS
2009
IEEE
119views Hardware» more  ATS 2009»
15 years 10 months ago
Fault Diagnosis Using Test Primitives in Random Access Memories
As diagnostic testing for memory devices increasingly gains in importance, companies are looking for flexible, cost effective methods to perform diagnostics on their failing devi...
Zaid Al-Ars, Said Hamdioui
ENTCS
2007
108views more  ENTCS 2007»
15 years 3 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
15 years 10 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak