Sciweavers

197 search results - page 4 / 40
» Some Topological Methods in Graph Coloring Theory
Sort
View
CVIU
2007
125views more  CVIU 2007»
13 years 7 months ago
Graph regularization for color image processing
Nowadays color image processing is an essential issue in computer vision. Variational formulations provide a framework for color image restoration, smoothing and segmentation prob...
Olivier Lezoray, Abderrahim Elmoataz, Sébas...
ICPR
2002
IEEE
14 years 8 months ago
Building the Topological Tree by Recursive FCM Color Clustering
In this paper we define a Topological Tree (TT) as a knowledge representation method that aims to describe important visual and spatial features of image regions, namely the color...
Rita Cucchiara, Costantino Grana, Andrea Prati, St...
GC
2007
Springer
13 years 7 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
CN
2007
95views more  CN 2007»
13 years 7 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn