Sciweavers

6568 search results - page 207 / 1314
» Reducing the Complexity of Reductions
Sort
View
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
15 years 8 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
2010
Springer
205views Education» more  CORR 2010»
15 years 6 months ago
Behavioral Simulations in MapReduce
In many scientific domains, researchers are turning to large-scale behavioral simulations to better understand real-world phenomena. While there has been a great deal of work on s...
Guozhang Wang, Marcos Antonio Vaz Salles, Benjamin...
SIGMOD
2009
ACM
121views Database» more  SIGMOD 2009»
16 years 6 months ago
Query-aware shrinking test databases
Keeping the test databases as small as possible leads to faster execution of tests and facilitates the task of completing the test cases and evaluating the actual outputs against ...
Claudio de la Riva, Javier Tuya, María Jos&...
ISCAS
1999
IEEE
113views Hardware» more  ISCAS 1999»
15 years 11 months ago
Energy efficient software through dynamic voltage scheduling
The energy usage of computer systems is becoming important, especially for portablebattery-operated applications and embedded systems. A significant reduction in the energy consum...
Gangadhar Konduri, James Goodman, Anantha Chandrak...
LFCS
1994
Springer
15 years 10 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote