16404 search results - page 2730 / 3281 » A set coverage problem |
207
click to vote
NIPS
2007
15 years 8 months ago
2007
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
167
click to vote
NIPS
2007
15 years 8 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
200
Voted
NIPS
2007
15 years 8 months ago
2007
Active learning sequentially selects unlabeled instances to label with the goal of reducing the effort needed to learn a good classifier. Most previous studies in active learning...
184
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
194
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...