81 search results - page 4 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
110
click to vote
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
111
click to vote
AAAI
2011
14 years 2 months ago
2011
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
117
click to vote
CLEF
2010
Springer
15 years 2 months ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
126
click to vote
JCPHY
2011
14 years 5 months ago
2011
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
120
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...