Sciweavers

527 search results - page 100 / 106
» Globally Optimal Estimates for Geometric Reconstruction Prob...
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Distributed multiagent learning with a broadcast adaptive subgradient method
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
Renato L. G. Cavalcante, Alex Rogers, Nicholas R. ...
ICML
2004
IEEE
14 years 9 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
AMS
2007
Springer
221views Robotics» more  AMS 2007»
14 years 2 months ago
Visual Bearing-Only Simultaneous Localization and Mapping with Improved Feature Matching
Abstract. In this this paper, we present a solution to the simultaneous localization and mapping (SLAM) problem for a robot equipped with a single perspective camera. We track extr...
Hauke Strasdat, Cyrill Stachniss, Maren Bennewitz,...
ASPDAC
2005
ACM
100views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Microarchitecture evaluation with floorplanning and interconnect pipelining
— As microprocessor technology continues to scale into the nanometer regime, recent studies show that interconnect delay will be a limiting factor for performance, and multiple c...
Ashok Jagannathan, Hannah Honghua Yang, Kris Konig...
AAAI
2006
13 years 10 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch