662 search results - page 52 / 133 » Making inferences with small numbers of training sets |
AAAI
2000
13 years 10 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— Perceptual aliasing makes topological navigation a difficult task. In this paper we present a general approach for topological SLAM (simultaneous localisation and mapping) whi...
TSMC
2008
13 years 8 months ago
2008
In this paper, we propose two cooperative ensemble learning algorithms, i.e., NegBagg and NegBoost, for designing neural network (NN) ensembles. The proposed algorithms incremental...
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
260
click to vote
Presentation
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...