2924 search results - page 116 / 585 » Lower Bounds in Distributed Computing |
CORR
2010
Springer
15 years 22 days ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
73
Voted
JCO
2007
15 years 16 days ago
2007
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
82
Voted
AUTOMATICA
2010
15 years 23 days ago
2010
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...
75
Voted
TIT
2002
15 years 8 days ago
2002
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
102
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...