16404 search results - page 2729 / 3281 » A set coverage problem |
178
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
165
click to vote
NAACL
2007
15 years 8 months ago
2007
This paper presents a maximum entropy machine translation system using a minimal set of translation blocks (phrase-pairs). While recent phrase-based statistical machine translatio...
161
click to vote
NIPS
2007
15 years 8 months ago
2007
In this paper we investigate multi-task learning in the context of Gaussian Processes (GP). We propose a model that learns a shared covariance function on input-dependent features...
167
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
184
click to vote
NIPS
2007
15 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...