Sciweavers

1273 search results - page 239 / 255
» Recovery from
Sort
View
TIT
2008
110views more  TIT 2008»
13 years 8 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
14 years 2 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
ICDCS
2012
IEEE
11 years 10 months ago
Combining Partial Redundancy and Checkpointing for HPC
Today’s largest High Performance Computing (HPC) systems exceed one Petaflops (1015 floating point operations per second) and exascale systems are projected within seven years...
James Elliott, Kishor Kharbas, David Fiala, Frank ...
INFOCOM
2010
IEEE
13 years 6 months ago
Pricing under Constraints in Access Networks: Revenue Maximization and Congestion Management
Abstract—This paper investigates pricing of Internet connectivity services in the context of a monopoly ISP selling broadband access to consumers. We first study the optimal com...
Prashanth Hande, Mung Chiang, A. Robert Calderbank...
WECWIS
2003
IEEE
102views ECommerce» more  WECWIS 2003»
14 years 1 months ago
FUSION: A System Allowing Dynamic Web Service Composition and Automatic Execution
Service portals are systems which expose a bundle of web services to the user, allowing the specification and subsequent execution of complex tasks defined over these individual...
Debra E. VanderMeer, Anindya Datta, Kaushik Dutta,...