4 search results - page 1 / 1 » Testing Convexity Properties of Tree Colorings |
STACS
2007
Springer
13 years 11 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
MMSP
2008
IEEE
13 years 11 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...