Sciweavers

15485 search results - page 21 / 3097
» Computing Optimal Subsets
Sort
View
ICIP
2004
IEEE
14 years 9 months ago
Distortion-buffer optimized tcp video streaming
This paper presents a distortion optimized streaming algorithm for on-demand streaming of multimedia. Given the pre-encoded packets of a multimedia stream, we propose an algorithm...
Anshul Sehgal, Olivier Verscheure, Pascal Frossard
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
SCHEDULING
2010
116views more  SCHEDULING 2010»
13 years 6 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
ISPASS
2008
IEEE
14 years 1 months ago
Independent Component Analysis and Evolutionary Algorithms for Building Representative Benchmark Subsets
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...
Vassilios N. Christopoulos, David J. Lilja, Paul R...
STACS
2005
Springer
14 years 1 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek