Sciweavers

9284 search results - page 349 / 1857
» Knowledge State Algorithms
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 2 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
ICASSP
2011
IEEE
14 years 11 months ago
A Kalman-like algorithm with no requirements for noise and initial conditions
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...
Yuriy S. Shmaliy
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 11 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...
ICML
2010
IEEE
15 years 8 months ago
Boosting for Regression Transfer
The goal of transfer learning is to improve the learning of a new target concept given knowledge of related source concept(s). We introduce the first boosting-based algorithms for...
David Pardoe, Peter Stone
ICML
2005
IEEE
16 years 8 months ago
Identifying useful subgoals in reinforcement learning by local graph partitioning
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
Özgür Simsek, Alicia P. Wolfe, Andrew G....