Sciweavers

112 search results - page 17 / 23
» Rounds in Communication Complexity Revisited
Sort
View
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
Allen Chuang, Albert Guillen i Fabregas, Lars K. R...
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
14 years 26 days ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee
ISCAPDCS
2004
13 years 9 months ago
A VFSA Scheduler for Radiative Transfer Data in Climate Models
Scheduling and load-balancing techniques play an integral role in reducing the overall execution time of scientific applications on clustered multi-node systems. The increasing co...
S. P. Muszala, Gita Alaghband, Daniel A. Connors, ...
ICISC
2009
184views Cryptology» more  ICISC 2009»
13 years 5 months ago
Efficient Privacy-Preserving Face Recognition
Abstract. Automatic recognition of human faces is becoming increasingly popular in civilian and law enforcement applications that require reliable recognition of humans. However, t...
Ahmad-Reza Sadeghi, Thomas Schneider 0003, Immo We...