4860 search results - page 605 / 972 » SNPs Problems, Complexity, and Algorithms |
164
Voted
ECML
2003
Springer
15 years 10 months ago
2003
Springer
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
145
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
175
Voted
AUTOMATICA
2008
15 years 5 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
149
click to vote
CVIU
2006
15 years 5 months ago
2006
A novel approach is proposed to analyzing and tracking the motion of structured deformable shapes, which consist of multiple correlated deformable subparts. Since this problem is ...
165
click to vote
IANDC
2006
15 years 5 months ago
2006
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind cha...