Sciweavers

57 search results - page 6 / 12
» On a linear programming approach to the discrete Willmore bo...
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 5 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
MSWIM
2005
ACM
14 years 1 months ago
The optimal choice of encoding parameters for MPEG-4 AAC streamed over wireless networks
This paper addresses a novel linear programming based approach to optimize the choice of the encoding parameters for the MPEG-4 AAC audio codec. Current techniques solve the encod...
Claus Bauer
DAC
2005
ACM
14 years 8 months ago
Energy optimal speed control of devices with discrete speed sets
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...
Ravishankar Rao, Sarma B. K. Vrudhula
CEC
2007
IEEE
14 years 2 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke
DCC
2005
IEEE
14 years 7 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...