2310 search results - page 180 / 462 » Coloring Random Graphs |
120
click to vote
MVA
2007
15 years 3 months ago
2007
In this paper, we first generalize a recent statistical color image segmentation algorithm [5] to arbitrary graphs, and report its performance for 2D images, 3D meshes and volume...
IPL
2006
15 years 2 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
140
Voted
SIAMDM
2010
15 years 24 days ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
134
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We present a multispectral photometric stereo method for capturing geometry of deforming surfaces. A novel photometric calibration technique allows calibration of scenes containin...
95
Voted
IM
2007
15 years 2 months ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...