263 search results - page 38 / 53 » Minimum Entropy Coloring |
130
click to vote
ENGL
2007
15 years 1 months ago
2007
—Instantaneous detection and diagnosis of various faults and break-downs in industrial processes is required to reduce production losses and damage to equipments. A solved knowle...
95
Voted
COMBINATORICS
1999
15 years 1 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...
116
Voted
ENDM
2008
15 years 1 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
76
Voted
COMBINATORICS
2006
15 years 1 months 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...
113
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
Feature points for image correspondence are often selected according to subjective criteria (e.g. edge density, nostrils). In this paper, we present a general, non-subjective crit...