Sciweavers

1897 search results - page 144 / 380
» Conditional Linear Planning
Sort
View
CVIU
2004
114views more  CVIU 2004»
15 years 3 months ago
Illumination insensitive recognition using eigenspaces
Variations in illumination can have a dramatic effect on the appearance of an object in an image. In this paper, we propose how to deal with illumination variations in eigenspace ...
Horst Bischof, Horst Wildenauer, Ales Leonardis
ICONIP
2010
15 years 2 months ago
Learning Basis Representations of Inverse Dynamics Models for Real-Time Adaptive Control
Abstract. In this paper, we propose a novel approach for adaptive control of robotic manipulators. Our approach uses a representation of inverse dynamics models learned from a vari...
Yasuhito Horiguchi, Takamitsu Matsubara, Masatsugu...
136
Voted
IJSYSC
2010
65views more  IJSYSC 2010»
15 years 1 months ago
Partial state and input observability recovering by additional sensor implementation: a graph-theoretic approach
This paper deals with the problem of additional sensor location in order to recover the observability of any given part of the state and unknown input for structured linear system...
T. Boukhobza
DCC
2005
IEEE
16 years 3 months ago
A Family of Binary (t, m, s)-Nets of Strength 5
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
Jürgen Bierbrauer, Yves Edel
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 10 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith