1618 search results - page 84 / 324 » Testing random number generators |
CMSB
2006
Springer
14 years 1 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
IPPS
2008
IEEE
14 years 4 months ago
2008
IEEE
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
HICSS
2009
IEEE
14 years 4 months ago
2009
IEEE
This paper discusses the design and implementation of a Service Generator Toolkit (SGT) that allows web services researchers to easily create large numbers of web services. When d...
CSDA
2008
13 years 10 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...