2698 search results - page 382 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
179
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
164
click to vote
PASTE
2004
ACM
15 years 12 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
174
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
178
click to vote
JMLR
2012
13 years 9 months ago
2012
In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothe...
186
click to vote
ACL
2012
13 years 8 months ago
2012
This paper proposes a data-driven method for concept-to-text generation, the task of automatically producing textual output from non-linguistic input. A key insight in our approac...