683 search results - page 97 / 137 » Generalization Bounds for Learning Kernels |
122
Voted
ECML
1998
Springer
15 years 8 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
136
Voted
JAIR
2000
15 years 3 months ago
2000
A major problem in machine learning is that of inductive bias: how to choose a learner's hypothesis space so that it is large enough to contain a solution to the problem bein...
158
Voted
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
134
click to vote
DAC
2006
ACM
15 years 7 months ago
2006
ACM
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
144
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...