840 search results - page 133 / 168 » Inapproximability of Combinatorial Optimization Problems |
GLOBECOM
2009
IEEE
13 years 8 months ago
2009
IEEE
We propose a novel equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) channels characterized by severe delay spreads. The proposed equalizer is based on reacti...
COMPGEOM
2009
ACM
14 years 5 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
CRYPTO
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
WWW
2009
ACM
14 years 11 months ago
2009
ACM
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...