Sciweavers

7150 search results - page 41 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
MOR
2000
90views more  MOR 2000»
15 years 8 days ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
90
Voted
MOR
2008
109views more  MOR 2008»
15 years 13 days ago
A Unified Theorem on SDP Rank Reduction
We consider the problem of finding a low
Anthony Man-Cho So, Yinyu Ye, Jiawei Zhang
102
Voted
SIAMMAX
2011
79views more  SIAMMAX 2011»
14 years 3 months ago
Nonlinear Low Rank Modification of a Symmetric Eigenvalue Problem
This paper studies existence and uniqueness results and interlacing properties of nonlinear modifications of small rank of symmetric eigenvalue problems. Approximation properties ...
Heinrich Voss, Kemal Yildiztekin, Xin Huang
ESA
2011
Springer
251views Algorithms» more  ESA 2011»
14 years 7 days ago
Improved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke...
WWW
2011
ACM
14 years 7 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...