Sciweavers

5580 search results - page 250 / 1116
» Randomized priority algorithms
Sort
View
BMCBI
2006
198views more  BMCBI 2006»
15 years 6 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 ...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 8 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
ICDAR
2007
IEEE
16 years 19 days ago
Using Random Forests for Handwritten Digit Recognition
In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Subspaces. Th...
Simon Bernard, Sébastien Adam, Laurent Heut...
ISSTA
2006
ACM
16 years 8 days ago
Object distance and its application to adaptive random testing of object-oriented programs
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 6 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...