1329 search results - page 93 / 266 » Randomly Sampling Molecules |
129
click to vote
RSA
2011
14 years 9 months ago
2011
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...
129
Voted
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
—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 ...
108
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
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...
141
Voted
ICMLA
2007
15 years 3 months ago
2007
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...
110
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Both compressed sensing (CS) and parallel imaging effectively reconstruct magnetic resonance images from undersampled data. Combining both methods enables imaging with greater und...