Sciweavers

534 search results - page 24 / 107
» One more bit is enough
Sort
View
SIGCOMM
2010
ACM
13 years 8 months ago
Improving peer-to-peer file distribution: winner doesn't have to take all
Recent work on BitTorrent has shown that the choke/unchoke mechanism implements an auction where each peer tries to induce other peers into "unchoking" it by uploading m...
Ben Leong, Youming Wang, Su Wen, Cristina Carbunar...
SETA
2010
Springer
173views Mathematics» more  SETA 2010»
13 years 6 months ago
User-Irrepressible Sequences
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol ...
Kenneth W. Shum, Yijin Zhang, Wing Shing Wong
STOC
1994
ACM
95views Algorithms» more  STOC 1994»
13 years 11 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan
TIT
2010
112views Education» more  TIT 2010»
13 years 2 months ago
Codes for deletion and insertion channels with segmented errors
Abstract-- We consider deletion channels and insertion channels under an additional segmentation assumption: the input consists of disjoint segments of b consecutive bits, with at ...
Zhenming Liu, Michael Mitzenmacher
WCNC
2008
IEEE
14 years 2 months ago
Selective Relaying in Cooperative OFDM Systems: Two-Hop Random Network
— In this paper, we investigate two selective relaying schemes in cooperative OFDM systems. Selective OFDMA relaying, where the relay selection is performed in a per-subcarrier m...
Bo Gui, Lin Dai, Leonard J. Cimini Jr.