145 search results - page 24 / 29 » Strong Colorings of Hypergraphs |
63
Voted
SCIA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The rendering of lower resolution image data on higher resolution displays has become a very common task, in particular because of the increasing popularity of webcams, c...
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
ICPR
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper presents biological evidence for camouflage breaking using the convexity of the intensity function. Some animals use apatetic coloring especially to prevent their detec...
78
Voted
ENDM
2007
14 years 9 months ago
2007
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
TROB
2008
14 years 9 months ago
2008
Abstract--In robotic applications of visual simultaneous localization and mapping techniques, loop-closure detection and global localization are two issues that require the capacit...