The matrix-oriented version of the conjugate gradient (CG) method can be used to approximate solution certain linear matrix equations. To limit memory consumption, low-rank reduction factored iterates is often employed, possibly leading disruption regular convergence behavior. We analyze properties in regime and identify quantities that are responsible for early termination, usually stagnation,...

We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.

Improving AI planning algorithms relies on the ability to exploit the structure of the problem at hand. A promising direction is that of factored planning, where the domain is partitioned into subdomains with as little interaction as possible. Recent work in this field has led to an detailed theoretical analysis of such approaches and to a couple of high level planning algorithms, but with no p...

On-premise enterprise resource planning (ERP) systems are costly to maintain and adapt to specific needs. To lower the cost of ERP systems an on-demand consumption model can be employed. This requires ERP systems to support multi-tenancy and multi-threading to enable consolidation of multiple businesses onto the same operational system. To simplify the adaptation of ERP systems to customer-spec...

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...

We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form (1 i). Our result generalizes earlier work of Pak in which substantial restrictions were placed on the permutation being factored.

This paper presents investigations of features which can be used to predict Code-Switching speech. For this task, factored language models are applied and implemented into a state-of-the-art decoder. Different possible factors, such as words, part-of-speech tags, Brown word clusters, open class words and open class word clusters are explored. We find that Brown word clusters, part-of-speech tag...