1389 search results - page 110 / 278 » Improved Approximation Algorithms for Label Cover Problems |
137
click to vote
SODA
2010
ACM
16 years 18 days ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
123
click to vote
NIPS
2008
15 years 4 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
141
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
167
click to vote
EMNLP
2006
15 years 4 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
143
click to vote
SODA
2010
ACM
16 years 18 days ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...