Sciweavers

5052 search results - page 4 / 1011
» On the Complexity of Ordered Colorings
Sort
View
OTM
2005
Springer
14 years 25 days ago
Colored Petri Nets to Verify Extended Event-Driven Process Chains
Business processes are becoming more and more complex and at the same time their correctness is becoming a critical issue: The costs of errors in business information systems are g...
Kees M. van Hee, Olivia Oanea, Natalia Sidorova
VMV
2008
170views Visualization» more  VMV 2008»
13 years 8 months ago
Robust contour-based object tracking integrating color and edge likelihoods
We present in this paper a novel object tracking system based on 3D contour models. For this purpose, we integrate two complimentary likelihoods, defined on local color statistics...
Giorgio Panin, Erwin Roth, Alois Knoll
ICDAR
2009
IEEE
13 years 5 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...
BMCBI
2006
76views more  BMCBI 2006»
13 years 7 months ago
Coloring the Mu transpososome
Background: Tangle analysis has been applied successfully to study proteins which bind two segments of DNA and can knot and link circular DNA. We show how tangle analysis can be e...
Isabel K. Darcy, Jeff Chang, Nathan Druivenga, Col...
CC
2006
Springer
133views System Software» more  CC 2006»
13 years 7 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx