Sciweavers

409 search results - page 61 / 82
» Iterative methods for computing generalized inverses
Sort
View
CVPR
1998
IEEE
14 years 9 months ago
Incorporating Illumination Constraints in Deformable Models
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
Dimitris Samaras, Dimitris N. Metaxas
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ATAL
2005
Springer
14 years 1 months ago
Fuzzy number approach to trust in coalition environment
General trust management model that we present is adapted for ad-hoc coalition environment, rather than for classic client-supplier relationship. The trust representation used in ...
Martin Rehák, Michal Pechoucek, Petr Benda
ATAL
2006
Springer
13 years 11 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
ML
2007
ACM
106views Machine Learning» more  ML 2007»
13 years 7 months ago
Surrogate maximization/minimization algorithms and extensions
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung