7930 search results - page 64 / 1586 » Greedy in Approximation Algorithms |
148
Voted
NIPS
1997
15 years 4 months ago
1997
There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of ...
157
Voted
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
107
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
109
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
125
click to vote
RTSS
2005
IEEE
15 years 8 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...