Sciweavers

1977 search results - page 73 / 396
» The satisfactory partition problem
Sort
View
COCOON
2008
Springer
15 years 7 months ago
Polychromatic Colorings of n-Dimensional Guillotine-Partitions
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
Balázs Keszegh
CGF
2008
110views more  CGF 2008»
15 years 6 months ago
Motorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
DAM
2008
131views more  DAM 2008»
15 years 6 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
EMMCVPR
2011
Springer
14 years 5 months ago
Globally Optimal Image Partitioning by Multicuts
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
Jörg H. Kappes, Markus Speth, Björn Andr...
CAIP
2005
Springer
114views Image Analysis» more  CAIP 2005»
15 years 11 months ago
A Segmentation Algorithm for Noisy Images
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
Soufiane Rital, Hocine Cherifi, Serge Miguet