574 search results - page 12 / 115 » Approximation Algorithms for Free-Label Maximization |
EOR
2008
13 years 8 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
AAAI
2010
13 years 10 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
EWSN
2011
Springer
13 years 2 days ago
2011
Springer
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...