728 search results - page 13 / 146 » Compressing combinatorial objects |
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
JCT
2006
14 years 9 months ago
2006
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
In network tomography, we seek to infer link status parameters (such as delay) inside a network through end-toend probe sending between (external) boundary nodes. The main challeng...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...