Sciweavers

6568 search results - page 87 / 1314
» Reducing the Complexity of Reductions
Sort
View
127
Voted
TWC
2008
76views more  TWC 2008»
15 years 6 months ago
A Reduced-PAR Opportunistic STBC Scheme for Frequency-Selective Channels in the Presence of Frequency Offset
Opportunistic space-time block codes (STBC) have been investigated for flat-fading channels in the literature. In this paper, we present a novel scheme for integrating them with or...
Dandan Wang, Hlaing Minn, Naofal Al-Dhahir
153
Voted
INFOCOM
2012
IEEE
13 years 8 months ago
Distributed storage codes reduce latency in vehicular networks
—We investigate the benefits of distributed storage using erasure codes for file sharing in vehicular networks through realistic trace-based simulations. We find that coding o...
Maheswaran Sathiamoorthy, Alexandros G. Dimakis, B...
145
Voted
FSE
2005
Springer
98views Cryptology» more  FSE 2005»
15 years 11 months ago
New Attacks Against Reduced-Round Versions of IDEA
In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 ro...
Pascal Junod
ORL
2010
98views more  ORL 2010»
15 years 4 months ago
A facial reduction algorithm for finding sparse SOS representations
Facial reduction algorithm reduces the size of the positive semidefinite cone in SDP. The elimination method for a sparse SOS polynomial ([3]) removes unnecessary monomials for a...
Hayato Waki, Masakazu Muramatsu
150
Voted
EUSFLAT
2001
15 years 7 months ago
Reduction to independent variables: from normal distribution to general statistical case to fuzzy
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...
Mourad Oussalah, Hung T. Nguyen, Vladik Kreinovich