Sciweavers

765 search results - page 1 / 153
» Graph Coloring with Rejection
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
14 years 7 days ago
Graph Coloring with Rejection
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
ICDAR
2009
IEEE
13 years 6 months ago
Graph b-Coloring for Automatic Recognition of Documents
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
Djamel Gaceb, Véronique Eglin, Frank Lebour...
ICPR
2008
IEEE
14 years 3 months ago
Application of graph coloring in physical layout segmentation
Every-day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localizatio...
Djamel Gaceb, Véronique Eglin, Frank Lebour...
FSTTCS
2000
Springer
14 years 5 days ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
CVIU
2008
141views more  CVIU 2008»
13 years 8 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon