2924 search results - page 308 / 585 » Lower Bounds in Distributed Computing |
137
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
121
click to vote
MP
2007
15 years 4 months ago
2007
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
112
click to vote
FOCM
2010
15 years 3 months ago
2010
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
131
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
151
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...