|
Volumn 4110 LNCS, Issue , 2006, Pages 272-279
|
A fast random sampling algorithm for sparsifying matrices
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMBINATORIAL MATHEMATICS;
COMPUTATIONAL COMPLEXITY;
MATRIX ALGEBRA;
PROBLEM SOLVING;
VECTORS;
CHERNOFF-HOEFFDING BOUNDS;
RANDOM SAMPLING ALGORITHMS;
SPARSIFYING MATRICES;
ALGORITHMS;
|
EID: 33750091599
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/11830924_26 Document Type: Conference Paper |
Times cited : (65)
|
References (11)
|