433 search results - page 34 / 87 » Generalized Ham-Sandwich Cuts |
ICCV
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
MP
2010
14 years 10 months ago
2010
In this paper, we introduce an operation that creates families of facet-defining inequalities for highdimensional infinite group problems using facet-defining inequalities of l...
SIAMJO
2011
14 years 6 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
146
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...