7930 search results - page 19 / 1586 » Greedy in Approximation Algorithms |
ICML
2010
IEEE
15 years 23 days ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
ICML
2010
IEEE
15 years 23 days ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
ICPR
2008
IEEE
16 years 27 days ago
2008
IEEE
We consider layouting news articles on a page as a cutting and packing problem with output maximization. We propose to tailor news articles by employing automatic summarization to...