306 search results - page 16 / 62 » On the Minimal Uncompletable Word Problem |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
MCM
2011
13 years 2 months ago
2011
When filtering through a wall with constant averaging radius, in addition to the subfilter scale stresses, a non-closed commutator term arises. We consider a proposal of Das and ...
PC
2011
13 years 2 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
SIAMIS
2010
13 years 2 months ago
2010
We study nonparametric regression between Riemannian manifolds based on regularized empirical risk minimization. Regularization functionals for mappings between manifolds should re...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...