648 search results - page 8 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— While the model parameters of many kernel learning methods are given by the solution of a convex optimisation problem, the selection of good values for the kernel and r...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
ISMIR
2005
Springer
14 years 1 months 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...