85 search results - page 3 / 17 » Distribution sort with randomized cycling |
BMCBI
2008
14 years 9 months ago
2008
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
DM
2010
14 years 9 months ago
2010
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a...
SPAA
1992
ACM
15 years 1 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...