5115 search results - page 104 / 1023 » On Randomized Lanczos Algorithms |
145
click to vote
CSDA
2006
15 years 6 months ago
2006
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
189
click to vote
ICDAR
2011
IEEE
14 years 5 months ago
2011
IEEE
—In this paper, we propose a novel method for extracting handwritten characters from multi-language document images, which may contain various types of characters, e.g. Chinese, ...
179
click to vote
SC
2005
ACM
15 years 12 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
197
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
175
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...