Sciweavers

478 search results - page 25 / 96
» Convexity minimizes pseudo-triangulations
Sort
View
AAAI
2007
13 years 10 months ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer
ISVC
2005
Springer
14 years 1 months ago
A Vectorial Self-dual Morphological Filter Based on Total Variation Minimization
We present a vectorial self dual morphological filter. Contrary to many methods, our approach does not require the use of an ordering on vectors. It relies on the minimization of ...
Jérôme Darbon, Sylvain Peyronnet
ICIP
2010
IEEE
13 years 5 months ago
Anisotropic diffusion using power watersheds
Many computer vision applications such as image filtering, segmentation and stereo-vision can be formulated as optimization problems.Whereas in previous decades continuousdomain, ...
Camille Couprie, Leo J. Grady, Laurent Najman, Hug...
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 2 months ago
Parallel Online Learning
Online learning algorithms have impressive convergence properties when it comes to risk minimization and convex games on very large problems. However, they are inherently sequenti...
Daniel Hsu, Nikos Karampatziakis, John Langford, A...
SIAMJO
2011
12 years 10 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...