2060 search results - page 10 / 412 » Some Applications of Coding Theory in Computational Complexi... |
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
130
click to vote
HPDC
1993
IEEE
1993
IEEE
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
15 years 1 months ago
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
116
click to vote
STOC
2012
ACM
13 years 1 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
TSP
2008
14 years 9 months ago
2008
Over the past several years, there has been a renewed interest in complex orthogonal designs for their application in space-time block coding. Motivated by the success of this app...