513 search results - page 68 / 103 » Soft Edge Coloring |
114
Voted
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper presents a novel method for mobile robot localization using visual appearance features. A multidimensional-histogram is used to describe the global appearance features ...
91
Voted
DEXAW
1999
IEEE
15 years 4 months ago
1999
IEEE
A robust method for the localization of frames within document images is presented. It aims at detecting regions delimited by closed polygonal lines or edges in complex color, gra...
70
Voted
COMBINATORICS
2006
15 years 16 days ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
111
Voted
JCT
2006
15 years 14 days ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
SIAMDM
2008
15 years 12 days ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...