16404 search results - page 385 / 3281 » A set coverage problem |
182
click to vote
APPROX
2009
Springer
16 years 23 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
151
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
158
click to vote
NAACL
2007
15 years 7 months ago
2007
This paper presents empirical results that contradict the prevailing opinion that entity extraction is a boring solved problem. In particular, we consider data sets that resemble ...
178
click to vote
MOR
2010
15 years 4 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
180
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...