6202 search results - page 71 / 1241 » Without Loss of Generality |
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we present a least square kernel machine with box constraints (LSKMBC). The existing least square machines assume Gaussian hyperpriors and subsequently express the ...
108
click to vote
ICML
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper is concerned with the generalization ability of learning to rank algorithms for information retrieval (IR). We point out that the key for addressing the learning proble...
IJCAI
2003
14 years 11 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
114
click to vote
EJC
2011
14 years 5 months ago
2011
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...