4894 search results - page 664 / 979 » Dynamic Abstraction Planning |
163
click to vote
ISNN
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
187
click to vote
ISVC
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. In this paper a new extension of the CONDENSATION algorithm, with application to infants face tracking, will be introduced. In this work we address the problem of trackin...
191
click to vote
LION
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
154
click to vote
LPNMR
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
231
click to vote
MASSDATA
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. In this paper, we present a general approach to shape characterization and deformation analysis of 2D/3D deformable visual objects. In particular, we define a reference ...