339 search results - page 14 / 68 » Random Sampling Techniques in Parallel Computation |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
ICPP
2008
IEEE
15 years 4 months ago
2008
IEEE
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
JPDC
2008
14 years 9 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
64
Voted
PKDD
2001
Springer
15 years 2 months ago
2001
Springer
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...
EMNLP
2010
14 years 7 months ago
2010
Production of parallel training corpora for the development of statistical machine translation (SMT) systems for resource-poor languages usually requires extensive manual effort. ...