4843 search results - page 484 / 969 » The Shortcut Problem - Complexity and Approximation |
171
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
177
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. We consider ...
161
click to vote
IGARSS
2009
15 years 4 months ago
2009
Finding an accurate sparse approximation of a spectral vector described by a linear model, when there is available a library of possible constituent signals (called endmembers or ...
225
click to vote
CNSR
2011
IEEE
14 years 9 months ago
2011
IEEE
—Principal component based anomaly detection has emerged as an important statistical tool for network anomaly detection. It works by projecting summary network information onto a...
197
Voted
TCC
2012
Springer
14 years 1 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...