2080 search results - page 281 / 416 » Measuring empirical computational complexity |
158
click to vote
ICRA
2000
IEEE
15 years 10 months ago
2000
IEEE
Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
158
click to vote
NIPS
2008
15 years 7 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
183
click to vote
UAI
2004
15 years 7 months ago
2004
Previous work on sensitivity analysis in Bayesian networks has focused on single parameters, where the goal is to understand the sensitivity of queries to single parameter changes...
177
click to vote
AAAI
2000
15 years 7 months ago
2000
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...
152
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Subspace tracking methods are widespread in signal and image processing. To reduce the influence of perturbations or outliers on the measurements, some authors have used a stocha...