697 search results - page 67 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
ICCV
2009
IEEE
15 years 22 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
CN
2010
13 years 7 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
CAIP
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a...
SIAMCOMP
1998
13 years 7 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...