In many image and signal processing applications, as interferometric synthetic aperture radar (SAR) or color image restoration in HSV or LCh spaces the data has its range on the one-dimensional sphere S. Although the minimization of total variation (TV) regularized functionals is among the most popular methods for edge-preserving image restoration such methods were only very recently applied to...

We give an algorithm for finding network encoding and decoding equations for errorfree multicasting networks with multiple sources and sinks. The algorithm given is efficient (polynomial complexity) and works on any kind of network (acyclic, link cyclic, flow cyclic, or even in the presence of knots). The key idea will be the appropriate use of the delay (both natural and additional) during the...

We improve on anO(n5 log n) algorithmbyKats and Levner [V. Kats, E. Levner, A polynomial algorithm for 2-cyclic robotic scheduling, in: Gelbukh, Reyes-García (Eds.), Proceedings of MICAI’06, in: LNAI, vol. 4293, Springer Verlag, 2006, pp. 439–449] for 2-cyclic robotic scheduling. We provide in this work an O(n2 log n) algorithm for this problem. © 2008 Elsevier B.V. All rights reserved.

Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize constacyclic codes. As an application the found many with good parameters properties. particular, 22 that improve minimum distances best known linear (BKLCs).

In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-infinite cyclic groups where the input is elements in normal form. We do this by adapting the work of Bogopolski, Martino, Maslakova, and Ventura in [1] and Bogopolski, Martino, and Ventura in [2], to free abelian-by-infinite cyclic groups, and in certain cases a...

A generalization of the cyclic Jacobi algorithm is proposed that works in an arbitrary compact Lie algebra. This allows, in particular, a unified treatment of Jacobi algorithms on different classes of matrices, such as, e.g., skew-symmetric or skew-Hermitian Hamiltonian matrices. Wildberger has established global, linear convergence of the algorithm for the classical Jacobi method on compact Li...