1389 search results - page 139 / 278 » Improved Approximation Algorithms for Label Cover Problems |
133
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
145
Voted
TC
2011
14 years 10 months ago
2011
—This paper considers the problem of dividing a two-word integer by a single-word integer, together with a few extensions and applications. Due to lack of efficient division ins...
119
Voted
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
124
click to vote
JACM
2006
15 years 3 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
112
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...