Sciweavers

777 search results - page 135 / 156
» Learning dynamic algorithm portfolios
Sort
View
NN
2002
Springer
115views Neural Networks» more  NN 2002»
15 years 2 months ago
A self-organising network that grows when required
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
Stephen Marsland, Jonathan Shapiro, Ulrich Nehmzow
ICRA
2010
IEEE
170views Robotics» more  ICRA 2010»
15 years 1 months ago
Robust vehicle localization in urban environments using probabilistic maps
— Autonomous vehicle navigation in dynamic urban environments requires localization accuracy exceeding that available from GPS-based inertial guidance systems. We have shown prev...
Jesse Levinson, Sebastian Thrun
ICFP
2008
ACM
16 years 2 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
CVPR
2007
IEEE
16 years 5 months ago
Connecting the Out-of-Sample and Pre-Image Problems in Kernel Methods
Kernel methods have been widely studied in the field of pattern recognition. These methods implicitly map, "the kernel trick," the data into a space which is more approp...
Pablo Arias, Gregory Randall, Guillermo Sapiro
ICPR
2004
IEEE
16 years 4 months ago
Switching Particle Filters for Efficient Real-time Visual Tracking
Particle filtering is an approach to Bayesian estimation of intractable posterior distributions from time series signals distributed by non-Gaussian noise. A couple of variant par...
Kenji Doya, Shin Ishii, Takashi Bando, Tomohiro Sh...