Sciweavers

148 search results - page 5 / 30
» Comparing two systems: Beyond common random numbers
Sort
View
ICPPW
2009
IEEE
14 years 2 months ago
Comparing and Optimising Parallel Haskell Implementations for Multicore Machines
—In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects running on multicore machines. GpH and Eden are both constructed using the h...
Jost Berthold, Simon Marlow, Kevin Hammond, Abdall...
BMCBI
2006
198views more  BMCBI 2006»
13 years 7 months ago
Gene selection and classification of microarray data using random forest
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
Ramón Díaz-Uriarte, Sara Alvarez de ...
HT
2003
ACM
14 years 24 days ago
Simplifying annotation support for real-world-settings: a comparative study of active reading
Despite the multitude of existing interfaces for annotation, little is known about their influence on the created annotations. In this paper, first findings of a comparative video...
Hartmut Obendorf
SAC
2010
ACM
14 years 2 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
SRDS
2006
IEEE
14 years 1 months ago
Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...