3875 search results - page 109 / 775 » Approximation algorithms for the 0-extension problem |
136
click to vote
EMNLP
2010
15 years 2 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
127
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
129
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
151
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
121
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...