6568 search results - page 357 / 1314 » Reducing the Complexity of Reductions |
227
click to vote
IACR
2011
14 years 7 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
171
click to vote
APAL
2010
15 years 7 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
176
click to vote
TPDS
2008
15 years 7 months ago
2008
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
182
click to vote
ISPASS
2009
IEEE
16 years 2 months ago
2009
IEEE
We describe and evaluate two new, independently-applicable power reduction techniques for power management on processors that support dynamic voltage and frequency scaling (DVFS):...
190
click to vote
ICIP
2005
IEEE
16 years 9 months ago
2005
IEEE
The problem of appearance-based recognition of faces and facial expressions is addressed. Previous work on sliced inverse regression (SIR) resulted in the formulation of an appear...