Sciweavers

6568 search results - page 140 / 1314
» Reducing the Complexity of Reductions
Sort
View
CASC
2006
Springer
100views Mathematics» more  CASC 2006»
15 years 10 months ago
Reducing Computational Costs in the Basic Perturbation Lemma
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
Ainhoa Berciano, María José Jim&eacu...
VTC
2007
IEEE
128views Communications» more  VTC 2007»
16 years 23 days ago
Performance of Space-Code-Division Multiple-Access Systems Using Reduced-Rank Detection
Abstract—In this contribution the performance of multipleinput multiple-output space-division, code-division multipleaccess (MIMO SCDMA) is investigated, when the low-complexity ...
Jiliang Zhang, Lie-Liang Yang
VTC
2006
IEEE
100views Communications» more  VTC 2006»
16 years 15 days 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»
15 years 4 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
ICDCS
2011
IEEE
14 years 6 months ago
YSmart: Yet Another SQL-to-MapReduce Translator
— MapReduce has become an effective approach to big data analytics in large cluster systems, where SQL-like queries play important roles to interface between users and systems. H...
Rubao Lee, Tian Luo, Yin Huai, Fusheng Wang, Yongq...