356 search results - page 22 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
CVPR
2011
IEEE
12 years 11 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
ISCAS
1999
IEEE
14 years 3 days ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...