Sciweavers

7 search results - page 2 / 2
» Linear programming bounds for codes via a covering argument
Sort
View
IPL
2010
114views more  IPL 2010»
13 years 3 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 4 months ago
Optimal Scheduling of Peer-to-Peer File Dissemination
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Intern...
Jochen Mundinger, Richard R. Weber, Gideon Weiss