994 search results - page 133 / 199 » Custom Computing Machines for the Set Covering Problem |
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
97
Voted
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
108
click to vote
TALG
2008
15 years 13 days ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
75
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Although detecting text lines in machine printed documents is typically considered a solved problem, it is still a challenge to segment handwritten text lines in the general sense...
115
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Learning object categories from small samples is a challenging problem, where machine learning tools can in general provide very few guarantees. Exploiting prior knowledge may be ...