365 search results - page 6 / 73 » Solving the Multiplication Constraint in Several Approximati... |
UAI
1998
13 years 8 months ago
1998
tigate the use of temporally abstract actions, or macro-actions, in the solution of Markov decision processes. Unlike current models that combine both primitive actions and macro-...
GECCO
2005
Springer
14 years 29 days ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
ACCV
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we present a novel foreground extraction method that automatically identifies image regions corresponding to a common space region seen from multiple cameras. We as...
BMVC
2000
13 years 9 months ago
2000
This work presents a piecewise linear approximation to non-linear Point Distribution Models for modelling the human hand. The work utilises the natural segmentation of shape space...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...