Sciweavers

2621 search results - page 8 / 525
» Near orders and codes
Sort
View
FOCS
1995
IEEE
13 years 12 months ago
Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
d Abstract) Noga Alon ∗ Jeff Edmonds † Michael Luby ‡ An (n, c, , r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. ...
Noga Alon, Jeff Edmonds, Michael Luby
VTC
2007
IEEE
124views Communications» more  VTC 2007»
14 years 2 months ago
Near-Instantaneously Adaptive Cooperative Uplink Schemes Based on Space-Time Block Codes and V-Blast
- In this paper we propose two adaptive schemes for improving the achievable Bandwidth Efficiency (BE) of cooperative diversity aided wireless networks. These schemes are capable ...
Mohammed El-Hajjar, Salam A. Zummo, Lajos Hanzo
VTC
2007
IEEE
14 years 2 months ago
Near-Capacity Turbo Trellis Coded Modulation Design
Soon Xin Ng, Osamah Alamri, Yonghui Li, Lajos Hanz...
FCCM
2000
IEEE
71views VLSI» more  FCCM 2000»
14 years 25 days ago
Implementation of Near Shannon Limit Error-Correcting Codes Using Reconfigurable Hardware
Benjamin A. Levine, R. Reed Taylor, Herman Schmit
ICPR
2010
IEEE
13 years 11 months ago
Beyond "Near-Duplicates": Learning Hash Codes for Efficient Similar-Image Retrieval
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...
Shumeet Baluja, Michele Covell