495 search results - page 8 / 99 » Approximation algorithms for budgeted learning problems |
DA
2010
13 years 5 months ago
2010
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
ICIP
2000
IEEE
14 years 10 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
TSP
2008
13 years 8 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
AAAI
2008
13 years 10 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...
DCC
2002
IEEE
14 years 8 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...