Sciweavers

304 search results - page 36 / 61
» Solving Generalized Small Inverse Problems
Sort
View
AAAI
2008
13 years 10 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams
SIAMIS
2010
156views more  SIAMIS 2010»
13 years 2 months ago
Learning the Morphological Diversity
This article proposes a new method for image separation into a linear combination of morphological components. Sparsity in fixed dictionaries is used to extract the cartoon and osc...
Gabriel Peyré, Jalal Fadili, Jean-Luc Starc...
SCALESPACE
2007
Springer
14 years 1 months ago
Towards Segmentation Based on a Shape Prior Manifold
Incorporating shape priors in image segmentation has become a key problem in computer vision. Most existing work is limited to a linearized shape space with small deformation modes...
Patrick Etyngier, Renaud Keriven, Jean-Philippe Po...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
PAMI
2012
11 years 10 months ago
A Least-Squares Framework for Component Analysis
— Over the last century, Component Analysis (CA) methods such as Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA), Canonical Correlation Analysis (CCA), Lap...
Fernando De la Torre