Sciweavers

2698 search results - page 144 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
TCSV
2002
148views more  TCSV 2002»
15 years 6 months ago
A full-featured, error-resilient, scalable wavelet video codec based on the set partitioning in hierarchical trees (SPIHT) algor
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
Sungdae Cho, William A. Pearlman
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 18 days ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 6 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
AAAI
1998
15 years 7 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg