Sciweavers

163 search results - page 31 / 33
» Concatenated codes can achieve list-decoding capacity
Sort
View
MICRO
1998
IEEE
129views Hardware» more  MICRO 1998»
14 years 21 days ago
A Bandwidth-efficient Architecture for Media Processing
Media applications are characterized by large amounts of available parallelism, little data reuse, and a high computation to memory access ratio. While these characteristics are p...
Scott Rixner, William J. Dally, Ujval J. Kapasi, B...
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 8 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 8 months ago
Communication under Strong Asynchronism
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
Aslan Tchamkerten, Venkat Chandar, Gregory W. Worn...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 8 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...