448 search results - page 17 / 90 » On Parallel Pseudo-Random Number Generation |
SIGMOD
2009
ACM
14 years 3 months ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
BMVC
2000
13 years 10 months ago
2000
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...
PAAPP
2006
13 years 8 months ago
2006
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
SYNASC
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider P colonies as introduced in [4] and investigate their computational power when working in the maximally parallel and in the sequential mode. It turns out that there is...
IISWC
2009
IEEE
14 years 3 months ago
2009
IEEE
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...