Sciweavers

2223 search results - page 226 / 445
» Ontological Framework for Approximation
Sort
View
IROS
2007
IEEE
193views Robotics» more  IROS 2007»
15 years 11 months ago
Analyzing gaussian proposal distributions for mapping with rao-blackwellized particle filters
Abstract— Particle filters are a frequently used filtering technique in the robotics community. They have been successfully applied to problems such as localization, mapping, o...
Cyrill Stachniss, Giorgio Grisetti, Wolfram Burgar...
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
15 years 11 months ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev
IJCAI
2003
15 years 6 months ago
Generalizing Plans to New Environments in Relational MDPs
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
Carlos Guestrin, Daphne Koller, Chris Gearhart, Ne...
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 5 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
JMLR
2002
115views more  JMLR 2002»
15 years 5 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger