Sciweavers

85 search results - page 10 / 17
» Distribution sort with randomized cycling
Sort
View
HPDC
2010
IEEE
14 years 9 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
ICECCS
2002
IEEE
85views Hardware» more  ICECCS 2002»
15 years 2 months ago
Fault Detection Effectiveness of Spathic Test Data
This paper presents an approach for generating test data for unit-level, and possibly integration-level, testing based on sampling over intervals of the input probability distribu...
Jane Huffman Hayes, Pifu Zhang
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
15 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
JAL
2002
69views more  JAL 2002»
14 years 9 months ago
Rates of convergence for Quicksort
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
Ralph Neininger, Ludger Rüschendorf
BMCBI
2007
148views more  BMCBI 2007»
14 years 9 months ago
Computation of significance scores of unweighted Gene Set Enrichment Analyses
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
Andreas Keller, Christina Backes, Hans-Peter Lenho...