Searching for authors named "Luis Rademacher" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Matrix approximation and projective clustering via volume sampling
by Luis Rademacher, Luis Rademacher, Santosh Vempala, Santosh Vempala, Grant Wang, Grant Wang — 2006 — In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms
…We present two new results for the problem of approximating a given real m × n matrix A by a rank-k matrix D, where k < min{m, n}, so as to minimize ||A − D| | 2 F. It is known that by sampling O(k/ɛ) rows of the matrix, one can find a low-rank approximation with additive error ɛ||A| | 2 F. Our firs…
Cited by 29 (2 self) – Add To MetaCart

Amit Sinha and Anantha Chandrakasan. Energy Efficient Real-Time Scheduling
by Amit Deshp, C Amit Deshp, Luis Rademacher, Santosh Vempala, Grant Wang, Grant Wang, A. Deshpande, L. Rademacher, S. Vempala, G. Wang — 2001 — In Proceedings of the International Conference on Computer Aided Design (ICCAD
…Abstract: Frieze, Kannan, and Vempala (JACM 2004) proved that a small sample of rows of a given matrix A spans the rows of a low-rank approximation D that minimizes �A−D�F within a small additive error, and the sampling can be done efficiently using just two passes over the matrix. In this paper, we…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB