Search Sciweavers | Sciweavers

3875 search results - page 89 / 775

» Approximation Algorithms for the Max-coloring Problem

click to vote

SIAMJO
2010

125views more SIAMJO 2010»

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

13 years 3 months ago

Download www.cs.huji.ac.il

We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...

Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang

claim paper

Read More »

click to vote

SODA
2010
ACM

171views Algorithms» more SODA 2010»

Coresets and Sketches for High Dimensional Subspace Approximation Problems

14 years 6 months ago

Download www.almaden.ibm.com

We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...

Dan Feldman, Morteza Monemizadeh, Christian Sohler...

claim paper

Read More »

click to vote

FCT
2007
Springer

151views Applied Computing» more FCT 2007»

On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time

14 years 23 days ago

Download ccc.cs.uni-duesseldorf.de

We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...

Gábor Erdélyi, Lane A. Hemaspaandra,...

claim paper

Read More »

click to vote

IWOCA
2009
Springer

112views Algorithms» more IWOCA 2009»

The Guarding Problem - Complexity and Approximation

14 years 1 months ago