Sciweavers

360 search results - page 12 / 72
» Precision-at-ten considered redundant
Sort
View
TSP
2008
79views more  TSP 2008»
13 years 7 months ago
New Blind Block Synchronization for Transceivers Using Redundant Precoders
This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding...
Borching Su, P. P. Vaidyanathan
SIGCOMM
2005
ACM
14 years 28 days ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
CORR
2006
Springer
83views Education» more  CORR 2006»
13 years 7 months ago
Guessing under source uncertainty
This paper considers the problem of guessing the realization of a finite alphabet source when some side information is provided. The only knowledge the guesser has about the source...
Rajesh Sundaresan
WWW
2002
ACM
14 years 8 months ago
Aliasing on the world wide web: prevalence and performance implications
Aliasing occurs in Web transactions when requests containing different URLs elicit replies containing identical data payloads. Conventional caches associate stored data with URLs ...
Terence Kelly, Jeffrey C. Mogul
TIT
2008
72views more  TIT 2008»
13 years 7 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski