Sciweavers

144 search results - page 2 / 29
» Constraint Propagation in Graph Coloring
Sort
View
CIARP
2009
Springer
13 years 2 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
NIPS
2008
13 years 6 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
ICIP
2010
IEEE
13 years 2 months ago
Multi-label propagation for coherent video segmentation and artistic stylization
We present a new algorithm for segmenting video frames into temporally stable colored regions, applying our technique to create artistic stylizations (e.g. cartoons and paintings)...
Tinghuai Wang, Jean-Yves Guillemaut, John P. Collo...
GD
2006
Springer
13 years 8 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....
POPL
2001
ACM
14 years 5 months ago
Colored local type inference
We present a type system for a language based on F, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination o...
Martin Odersky, Christoph Zenger, Matthias Zenger