1389 search results - page 50 / 278 » Improved Approximation Algorithms for Label Cover Problems |
114
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
124
click to vote
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
107
click to vote
IPL
2006
15 years 2 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
126
Voted
JWSR
2007
15 years 2 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
119
click to vote
DCG
2010
15 years 2 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...