Sciweavers

1576 search results - page 16 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ANOR
2010
96views more  ANOR 2010»
13 years 10 months ago
Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions
Abstract The paper provides a condition for differentiability as well as an equivalent criterion for Lipschitz continuity of singular normal distributions. Such distributions are o...
René Henrion, Werner Römisch
NIPS
2007
13 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
ICIP
2004
IEEE
14 years 11 months ago
Theoretical analysis of some regularized image denoising methods
Regularization techniques have been in use in signal recovery for over four decades. In this paper, we propose a new, synthetic approach to the study of regularization methods in ...
Patrick L. Combettes, Valerie R. Wajs
IJCV
2010
158views more  IJCV 2010»
13 years 8 months ago
Metric Learning for Image Alignment
Abstract Image alignment has been a long standing problem in computer vision. Parameterized Appearance Models (PAMs) such as the Lucas-Kanade method, Eigentracking, and Active Appe...
Minh Hoai Nguyen, Fernando De la Torre
ICASSP
2011
IEEE
13 years 1 months ago
The Rotational Lasso
This paper presents a sparse approach of solving the onesided Procrustes problem with special orthogonal constraint. By leveraging a planar decomposition common to all rotation ma...
Alexander Lorbert, Peter J. Ramadge