Sciweavers

653 search results - page 79 / 131
» Using common random numbers for indifference-zone selection
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 9 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
CBMS
2005
IEEE
13 years 10 months ago
Local Dimensionality Reduction within Natural Clusters for Medical Data Analysis
Inductive learning systems have been successfully applied in a number of medical domains. Nevertheless, the effective use of these systems requires data preprocessing before apply...
Mykola Pechenizkiy, Alexey Tsymbal, Seppo Puuronen
JASIS
2010
170views more  JASIS 2010»
13 years 7 months ago
Analyzing URL queries
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
Wei Meng Lee, Mark Sanderson
BMCBI
2004
146views more  BMCBI 2004»
13 years 8 months ago
Multivariate search for differentially expressed gene combinations
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
Yuanhui Xiao, Robert D. Frisina, Alexander Gordon,...
BMCBI
2007
123views more  BMCBI 2007»
13 years 9 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...