We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Self-organizing computational models with specific intracortical connections can explain many features of visual cortex. However, due to their computation and memory requirements,...
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
We address a core aspect of the multilingual content synchronization task: the identification of novel, more informative or semantically equivalent pieces of information in two d...