276 search results - page 45 / 56 » Lower bounds for the complexity of linear functionals in the... |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
CP
2003
Springer
14 years 25 days ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
SWAT
2004
Springer
14 years 28 days ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...