1274 search results - page 24 / 255 » The Geometry of Coin-Weighing Problems |
TIT
2008
13 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
CCCG
2008
13 years 9 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
IPCO
2008
13 years 9 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
JCT
2007
13 years 7 months ago
2007
The codegree density γ(F) of an r-graph F is the largest number γ such that there are F-free r-graphs G on n vertices such that every set of r−1 vertices is contained in at le...
IJBC
2007
13 years 7 months ago
2007
Abstract. The stable and unstable invariant manifolds associated with Lyapunov orbits about the libration point L1 between the primaries in the planar circular restricted three-bod...