7150 search results - page 38 / 1430 » An Approximation Algorithm for Approximation Rank |
83
Voted
DEDS
2008
15 years 17 days ago
2008
Abstract Approximate simulation relations have recently been introduced as a powerful tool for the approximation of discrete and continuous systems. In this paper, we his abstracti...
132
Voted
BMCBI
2010
15 years 18 days ago
2010
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
125
click to vote
ICCV
2011
IEEE
14 years 15 days ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
108
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
90
Voted
APPROX
2006
Springer
15 years 4 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...