2780 search results - page 349 / 556 » Learning to Order Things |
137
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
125
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
122
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
139
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to han...
133
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...