120 search results - page 11 / 24 » Approximation and Hardness Results for Label Cut and Related... |
EMMCVPR
1999
Springer
13 years 11 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
NIPS
2007
13 years 9 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...