648 search results - page 16 / 130 » Simple Algorithms for a Weighted Interval Selection Problem |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Different features have different relevance to a particular learning problem. Some features are less relevant; while some very important. Instead of selecting the most relevant fe...
IPL
2006
13 years 7 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
CIKM
2000
Springer
14 years 19 hour ago
2000
Springer
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
The choice of a color space is of great importance for many computer vision algorithms (e.g. edge detection and object recognition). It induces the equivalence classes to the actu...