Sciweavers

573 search results - page 35 / 115
» Parallel Algorithms for Dandelion-Like Codes
Sort
View
CORR
2010
Springer
131views Education» more  CORR 2010»
14 years 8 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 1 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
ECCC
2010
122views more  ECCC 2010»
14 years 8 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
IESS
2007
Springer
162views Hardware» more  IESS 2007»
15 years 4 months ago
Automatic Parallelization of Sequential Specifications for Symmetric MPSoCs
Abstract This paper presents an embedded system design toolchain for automatic generation of parallel code runnable on symmetric multiprocessor systems from an initial sequential s...
Fabrizio Ferrandi, Luca Fossati, Marco Lattuada, G...
ASPLOS
2008
ACM
14 years 12 months ago
Communication optimizations for global multi-threaded instruction scheduling
The recent shift in the industry towards chip multiprocessor (CMP) designs has brought the need for multi-threaded applications to mainstream computing. As observed in several lim...
Guilherme Ottoni, David I. August