Sciweavers

5115 search results - page 104 / 1023
» On Randomized Lanczos Algorithms
Sort
View
CSDA
2006
82views more  CSDA 2006»
15 years 2 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
ICDAR
2011
IEEE
14 years 2 months ago
A Handwritten Character Extraction Algorithm for Multi-language Document Image
—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, ...
Yonghong Song, Guilin Xiao, Yuanlin Zhang, Lei Yan...
SC
2005
ACM
15 years 8 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 8 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
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...
Sumit Ganguly
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
15 years 2 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
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...
Sridhar Rajagopalan, Vijay V. Vazirani