160 search results - page 32 / 32 » On the List-Decodability of Random Linear Codes |
IPPS
2006
IEEE
14 years 8 days ago
2006
IEEE
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
BMCBI
2005
13 years 6 months ago
2005
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
CCE
2004
13 years 6 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
In this paper, we propose an efficient acquisition scheme for GPS receivers. It is shown that GPS signals can be effectively sampled and detected using a bank of randomized corre...