879 search results - page 44 / 176 » Greedy Attribute Selection |
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
WWW
2005
ACM
14 years 10 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
HEURISTICS
1998
13 years 9 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
ICIP
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we propose an approach for fast pedestrian detection in images. Inspired by the histogram of oriented gradient (HOG) features, a set of multi-scale orientation (MSO...