451 search results - page 60 / 91 » Some Lower Bounds on Geometric Separability Problems |
IPCO
1996
14 years 11 months ago
1996
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Distributed source coding is traditionally viewed in the block coding context -- all the source symbols are known in advance at the encoders. This paper instead considers a stream...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
89
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...