1389 search results - page 149 / 278 » Improved Approximation Algorithms for Label Cover Problems |
127
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
120
click to vote
SISAP
2008
IEEE
15 years 9 months ago
2008
IEEE
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
121
click to vote
ASPDAC
1999
ACM
15 years 7 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
103
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
115
click to vote
ILP
2001
Springer
15 years 7 months ago
2001
Springer
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...