6568 search results - page 92 / 1314 » Reducing the Complexity of Reductions |
151
click to vote
ICC
2007
IEEE
16 years 17 days ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
164
click to vote
PR
2008
15 years 6 months ago
2008
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
165
click to vote
ICISC
2008
2008
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
15 years 7 months ago
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
160
click to vote
AIML
2004
15 years 7 months ago
2004
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
146
click to vote
CALC
2001
Springer
15 years 10 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...