Sciweavers

570 search results - page 14 / 114
» Edge Coloring with Delays
Sort
View
CORR
2010
Springer
80views Education» more  CORR 2010»
14 years 6 months ago
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known dete...
Leonid Barenboim, Michael Elkin
CVPR
2008
IEEE
16 years 1 months ago
Transductive object cutout
In this paper, we address the issue of transducing the object cutout model from an example image to novel image instances. We observe that although object and background are very ...
Jingyu Cui, Qiong Yang, Fang Wen, Qiying Wu, Chang...
GC
2007
Springer
14 years 11 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
89
Voted
ICPR
2004
IEEE
16 years 26 days ago
A New Color Image Segmentation Algorithm based on Watershed Transformation
A new color segmentation method is presented in this paper. The method is specified for color images that have both large and small objects, and objects with both step and ramp ed...
Marat Kazanov
CPC
2008
112views more  CPC 2008»
14 years 12 months ago
When is an Almost Monochromatic K4 Guaranteed?
Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges rece...
Alexandr V. Kostochka, Dhruv Mubayi