Sciweavers

2715 search results - page 127 / 543
» Total Generalized Variation
Sort
View
93
Voted
STACS
2005
Springer
15 years 6 months ago
Cost Sharing and Strategyproof Mechanisms for Set Cover Games
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
Xiang-Yang Li, Zheng Sun, Weizhao Wang
108
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 1 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
GLVLSI
2008
IEEE
169views VLSI» more  GLVLSI 2008»
15 years 1 months ago
Simultaneous optimization of memory configuration and code allocation for low power embedded systems
This paper proposes a hybrid memory architecture which consists of the following two regions; 1) a dynamic power conscious region which uses low Vdd and Vth and 2) a static power ...
Tadayuki Matsumura, Tohru Ishihara, Hiroto Yasuura
114
Voted
IPPS
2010
IEEE
14 years 11 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
122
Voted
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 8 months ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain