16404 search results - page 423 / 3281 » A set coverage problem |
215
click to vote
JMLR
2010
15 years 5 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
161
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
173
click to vote
ISDA
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this contribution a feature selection method in semi-supervised problems is proposed. This method selects variables using a feature clustering strategy, using a combination ...
170
click to vote
WG
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
176
click to vote
ISMIR
2005
Springer
16 years 7 days ago
2005
Springer
In the “query-by-humming” problem, we attempt to retrieve a specific song from a target set based on a sung query. Recent evaluations of query-by-humming systems show that th...