Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

3

CORR
2008
Springer

favoriteEmaildiscussreport

44views Education» more CORR 2008»

An Improved Approximation Algorithm for the Column Subset Selection Problem

13 years 4 months ago

An Improved Approximation Algorithm for the Column Subset Selection Problem

Download pages.cs.wisc.edu

Christos Boutsidis, Michael W. Mahoney, Petros Dri

Real-time Traffic

CORR 2008 | Education |

claim paper

Related Content

» Submodular meets Spectral Greedy Algorithms for Subset Selection Sparse Approximation and ...

» Convex Relaxations for Subset Selection

» Relay Subset Selection in Wireless Networks Using Partial DecodeandForward Transmission

» The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Propos...

» A fast and efficient algorithm for lowrank approximation of a matrix

» A Polynomial Time Approximation Scheme for the Square Packing Problem

» Submodular Dictionary Selection for Sparse Representation

» The Largest Compatible Subset Problem for Phylogenetic Data

» Oscillating Feature Subset Search Algorithm for Text Categorization

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Christos Boutsidis, Michael W. Mahoney, Petros Drineas

Comments (0)