Sciweavers

306 search results - page 1 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 2 months ago
On the Minimal Uncompletable Word Problem
Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of wor...
Gabriele Fici, Elena V. Pribavkina, Jacques Sakaro...
ICASSP
2010
IEEE
13 years 5 months ago
Graph-based regularization for spherical signal interpolation
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...
Tamara Tosic, Tamara Frossard
JMMA
2010
162views more  JMMA 2010»
12 years 11 months ago
Co-clustering Documents and Words by Minimizing the Normalized Cut Objective Function
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...
Charles-Edmond Bichot
SIAMCO
2010
124views more  SIAMCO 2010»
12 years 11 months ago
Reachability and Minimal Times for State Constrained Nonlinear Problems without Any Controllability Assumption
We consider a target problem for a nonlinear system under state constraints. We give a new continuous level-set approach for characterizing the optimal times and the backward-reach...
Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidan...
MOR
2010
120views more  MOR 2010»
13 years 3 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...