570 search results - page 77 / 114 » Edge Coloring with Delays |
COMBINATORICS
1999
14 years 11 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
RSA
2011
14 years 6 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
180
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Given a single image of an arbitrary road, that may not
be well-paved, or have clearly delineated edges, or some
a priori known color or texture distribution, is it possible
for...
100
click to vote
MICCAI
2008
Springer
16 years 1 months ago
2008
Springer
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...
ICIP
2009
IEEE
16 years 26 days ago
2009
IEEE
Content aware image re-targeting methods aim to arbitrarily change image aspect ratios while preserving visually prominent features. To determine visual importance of pixels, exis...