Sciweavers

1329 search results - page 93 / 266
» Randomly Sampling Molecules
Sort
View
RSA
2011
157views more  RSA 2011»
13 years 5 months ago
The cover time of random geometric graphs
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
Colin Cooper, Alan M. Frieze
ICDM
2009
IEEE
199views Data Mining» more  ICDM 2009»
14 years 4 months ago
Active Learning with Adaptive Heterogeneous Ensembles
—One common approach to active learning is to iteratively train a single classifier by choosing data points based on its uncertainty, but it is nontrivial to design uncertainty ...
Zhenyu Lu, Xindong Wu, Josh Bongard
GECCO
2005
Springer
117views Optimization» more  GECCO 2005»
14 years 3 months ago
A study of evolutionary robustness in stochastically tiled polyominos
Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to po...
Justin Schonfeld, Daniel A. Ashlock
ICMLA
2007
13 years 11 months ago
Estimating class probabilities in random forests
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
Henrik Boström
ICASSP
2011
IEEE
13 years 2 months ago
Combined compressed sensing and parallel mri compared for uniform and random cartesian undersampling of K-space
Both compressed sensing (CS) and parallel imaging effectively reconstruct magnetic resonance images from undersampled data. Combining both methods enables imaging with greater und...
Daniel S. Weller, Jonathan R. Polimeni, Leo Grady,...