Sciweavers

90 search results - page 5 / 18
» Maximizing expected utility over a knapsack constraint
Sort
View
AI
2009
Springer
15 years 4 months ago
Exploratory Analysis of Co-Change Graphs for Code Refactoring
Abstract. Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS ha...
Hassan Khosravi, Recep Colak
GLOBECOM
2007
IEEE
15 years 3 months ago
Information Transmission Over Fading Channels
Abstract— We consider the lossy transmission of source information over Rayleigh fading channels. We investigate the utility of two channel capacity definitions, ergodic capacit...
Sayantan Choudhury, Jerry D. Gibson
GLOBECOM
2009
IEEE
15 years 4 months ago
Distortion Prediction for Video Quality Optimization over Packet Switched Networks
—Scheduling techniques are often deployed at the network edge to maximize the quality of the video communication while satisfying a given constraint on the maximum high priority ...
Andrea Vesco, Enrico Masala, Carlo Novara
FOCS
2005
IEEE
15 years 3 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 10 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan