Sciweavers

3875 search results - page 188 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
EOR
2006
103views more  EOR 2006»
15 years 5 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
INFOCOM
2009
IEEE
15 years 11 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
ICASSP
2011
IEEE
14 years 8 months ago
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ï...
Xi Zhang
ICIP
2000
IEEE
16 years 6 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
135
Voted
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 5 months ago
Approximating the minimum directed tree cover
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
Viet Hung Nguyen