803 search results - page 82 / 161 » Independence in Direct-Product Graphs |
160
Voted
CRV
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
115
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
152
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
112
Voted
GD
1999
Springer
15 years 5 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
140
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...