Sciweavers

3091 search results - page 19 / 619
» The Color Between Two Others
Sort
View
JDA
2010
88views more  JDA 2010»
14 years 9 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
WACV
2002
IEEE
15 years 3 months ago
Multi-sensor Super-Resolution
Image sensing is usually done with multiple sensors, like the RGB sensors in color imaging, the IR and EO sensors in surveillance and satellite imaging, etc. The resolution of eac...
Assaf Zomet, Shmuel Peleg
IMAGING
2004
15 years 12 days ago
Tensor Based Feature Detection for Color Images
Extending differential-based operations to color images is hindered by the multi-channel nature of color images. The derivatives in different channels can point in opposite direct...
Joost van de Weijer, Theo Gevers
77
Voted
ICALP
2007
Springer
15 years 5 months ago
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
HPCC
2005
Springer
15 years 4 months ago
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
Doruk Bozdag, Ümit V. Çatalyürek,...