Results 11  20
of
11,627
Asymptotic Distribution for Random Median Quicksort
, 2007
"... The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments and exponent ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments
Asymptotic Distribution Theo ~ for Correspondence Analysis
"... The asymptotic distribution of the eigenvectors and eigenvalues in correspondence analysis is derived using a method or Anderson (1963). The results are illustrated on a condensed version of data of Maung (l94l). The results are also applied to derive the asymptotic distribution of the eigenvectors ..."
Abstract
 Add to MetaCart
The asymptotic distribution of the eigenvectors and eigenvalues in correspondence analysis is derived using a method or Anderson (1963). The results are illustrated on a condensed version of data of Maung (l94l). The results are also applied to derive the asymptotic distribution
Asymptotic distributions Convergence of moments
"... X1,n ≥... ≥ Xn,n nonincreasing rearrengement of X1,...,Xn. If n clear from context, X1,n,...,Xn,n denoted by X(1),...,X(n). X(1) : sample maximum X(n/2) : sample median... Extreme value theory and classical statistics ..."
Abstract
 Add to MetaCart
X1,n ≥... ≥ Xn,n nonincreasing rearrengement of X1,...,Xn. If n clear from context, X1,n,...,Xn,n denoted by X(1),...,X(n). X(1) : sample maximum X(n/2) : sample median... Extreme value theory and classical statistics
The asymptotic distribution of Kloosterman sums by
"... bution of a wide class of generalized Kloosterman sums. To define these we let k be a global field and S a finite set of places of k containing the infinite ones, if there are any. Let kS = ..."
Abstract
 Add to MetaCart
bution of a wide class of generalized Kloosterman sums. To define these we let k be a global field and S a finite set of places of k containing the infinite ones, if there are any. Let kS =
On the Asymptotic Distribution of UStatistics
, 1979
"... a for p~bltO releeSS: ~ 9 1 1 2 7 0 3 ~ ..."
On the asymptotic distribution of large prime factors
 J. London Math. Soc
, 1993
"... A random integer N, drawn uniformly from the set {1,2,..., n), has a prime factorization of the form N = a1a2...aM where ax ^ a2>... ^ aM. We establish the asymptotic distribution, as «» • oo, of the vector A(«) = (loga,/logiV: i:> 1) in a transparent manner. By randomly reordering the comp ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
A random integer N, drawn uniformly from the set {1,2,..., n), has a prime factorization of the form N = a1a2...aM where ax ^ a2>... ^ aM. We establish the asymptotic distribution, as «» • oo, of the vector A(«) = (loga,/logiV: i:> 1) in a transparent manner. By randomly re
Results 11  20
of
11,627