Sciweavers

836 search results - page 98 / 168
» Orthogonal Colorings of Graphs
Sort
View
DAM
2008
88views more  DAM 2008»
15 years 2 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...
CHI
2009
ACM
16 years 2 months ago
Graph sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantita...
Robin Stewart, m. c. schraefel
DAM
2002
135views more  DAM 2002»
15 years 1 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
ICIP
2009
IEEE
14 years 11 months ago
Graph-based foreground extraction in extended color space
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...
Hansung Kim, Adrian Hilton
MCPR2
2011
104views more  MCPR2 2011»
14 years 4 months ago
People Detection Using Color and Depth Images
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...
Joaquín Salas, Carlo Tomasi