Sciweavers

351 search results - page 34 / 71
» An exact method for graph coloring
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Systematic Static Shadow Detection
A systematic static shadow detection algorithm for color images is presented in this paper. The image is modeled by an undirected graph and the shadow detection is achieved throug...
Jian Yao, Zhongfei (Mark) Zhang
SIAMDM
2008
118views more  SIAMDM 2008»
13 years 7 months ago
Ramsey-Type Problem for an Almost Monochromatic K4
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
Jacob Fox, Benny Sudakov
AAAI
1994
13 years 9 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
DAC
2005
ACM
14 years 8 months ago
Minimising buffer requirements of synchronous dataflow graphs with model checking
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
Marc Geilen, Twan Basten, Sander Stuijk
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell