Sciweavers

824 search results - page 45 / 165
» Weighted Low-Rank Approximations
Sort
View
ICDE
2001
IEEE
111views Database» more  ICDE 2001»
15 years 11 months ago
Overcoming Limitations of Sampling for Aggregation Queries
We study the problem of approximately answering aggregation queries using sampling. We observe that uniform sampling performs poorly when the distribution of the aggregated attrib...
Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev...
STOC
2007
ACM
117views Algorithms» more  STOC 2007»
15 years 10 months ago
A combinatorial, primal-dual approach to semidefinite programs
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
Sanjeev Arora, Satyen Kale
WINE
2009
Springer
171views Economy» more  WINE 2009»
15 years 4 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 1 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 4 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh