227 search results - page 2 / 46 » Weighted Coloring: Further Complexity and Approximability Re... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
The aim of salient point detection is to find distinctive events in images. Salient features are generally determined from the local differential structure of images. They focus o...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...
DAM
2006
13 years 5 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...