Sciweavers

2173 search results - page 8 / 435
» On the Values of Reducibility Candidates
Sort
View
HIPC
2003
Springer
14 years 17 days ago
FV-MSB: A Scheme for Reducing Transition Activity on Data Buses
Power consumption becomes an important issue for modern processors. The off-chip buses consume considerable amount of total power [9,7]. One effective way to reduce power is to red...
Dinesh C. Suresh, Jun Yang 0002, Chuanjun Zhang, B...
VTC
2006
IEEE
100views Communications» more  VTC 2006»
14 years 1 months ago
List Stack Detection with Reduced Search Space for MIMO Communication Systems
The interest in near-ML detection algorithms for Multiple-Input/lMultiple-Output (MIMO) systems have always been high due to their drastic performance gain over suboptimal algorith...
Woon Hau Chin, Sumei Sun
CANS
2010
Springer
197views Cryptology» more  CANS 2010»
13 years 5 months ago
Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
Bozhan Su, Wenling Wu, Shuang Wu, Le Dong
ESANN
2007
13 years 8 months ago
SOM+EOF for finding missing values
In this paper, a new method for the determination of missing values in temporal databases is presented. This new method is based on two projection methods: a nonlinear one (Self-Or...
Antti Sorjamaa, Paul Merlin, Bertrand Maillet, Ama...
ISMVL
1994
IEEE
124views Hardware» more  ISMVL 1994»
13 years 11 months ago
Approximating Propositional Calculi by Finite-Valued Logics
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
Matthias Baaz, Richard Zach