Sciweavers

3894 search results - page 162 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
COMPGEOM
2004
ACM
15 years 12 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
EOR
2006
103views more  EOR 2006»
15 years 6 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
16 years 1 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
ICIP
2000
IEEE
16 years 8 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
IPCO
2010
210views Optimization» more  IPCO 2010»
15 years 4 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...