213 search results - page 19 / 43 » The randomized complexity of initial value problems |
ICAISC
2010
Springer
14 years 13 days ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
NIPS
2003
13 years 9 months ago
2003
The detection and pose estimation of people in images and video is made challenging by the variability of human appearance, the complexity of natural scenes, and the high dimensio...
AAAI
2011
12 years 7 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
JMLR
2008
13 years 7 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...