Sciweavers

84 search results - page 7 / 17
» Optimal Hebbian Learning: A Probabilistic Point of View
Sort
View
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
14 years 2 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
ECAI
2006
Springer
13 years 11 months ago
Patch Learning for Incremental Classifier Design
We present a learning algorithm for nominal data. It builds a classifier by adding iteratively a simple patch function that modifies the current classifier. Its main advantage lies...
Rudy Sicard, Thierry Artières, Eric Petit
AAAI
2006
13 years 9 months ago
An Efficient Algorithm for Local Distance Metric Learning
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
Liu Yang, Rong Jin, Rahul Sukthankar, Yi Liu
COLT
2003
Springer
14 years 26 days ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
ICML
2007
IEEE
14 years 8 months ago
Percentile optimization in uncertain Markov decision processes with application to efficient exploration
Markov decision processes are an effective tool in modeling decision-making in uncertain dynamic environments. Since the parameters of these models are typically estimated from da...
Erick Delage, Shie Mannor