217 search results - page 31 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
IPCO
2007
14 years 11 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
CATS
1998
14 years 11 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
DAGM
2003
Springer
15 years 3 months ago
2003
Springer
In this paper we address the problem of building a good speech recognizer if there is only a small amount of training data available. The acoustic models can be improved by interpo...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...