Sciweavers

4894 search results - page 495 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
170
Voted
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 3 months ago
Budget Feasible Mechanisms
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
Christos H. Papadimitriou, Yaron Singer
FSTTCS
2010
Springer
15 years 3 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
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...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
GLOBECOM
2010
IEEE
15 years 3 months ago
Adaptive Modulation in Wireless Networks with Smoothed Flow Utility
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 ...
Ekine Akuiyibo, Stephen P. Boyd, Daniel O'Neill
142
Voted
IGARSS
2009
15 years 2 months ago
Unmixing Sparse Hyperspectral Mixtures
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 ...
Marian-Daniel Iordache, José M. Bioucas-Dia...
CNSR
2011
IEEE
257views Communications» more  CNSR 2011»
14 years 8 months ago
On Threshold Selection for Principal Component Based Network Anomaly Detection
—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...
Petar Djukic, Biswajit Nandy