The paper first shows that Kruskal tensors with matrix factors derived from orthogonal ternary vector lists define multivariable Boolean functions. These tensors make it possible to derive efficient algorithms for the generation of equivalent Zhegalkin polynomials, which are secondly used for identification of algebraic Boolean models, e.g. for gene expression dynamics. © 2011 IFAC.Unknow
We apply tensor rank-one decomposition (Savicky and Vomlel, 2005) to conditional probability tables ...
We apply tensor rank-one decomposition (Savicky and Vomlel, 2005) to conditional probability tables ...
This work is dedicated to the study of boolean decompositions of binary multidimensional arrays usin...
session speciale "Numerical multilinear algebra: a new beginning"We will discuss how numerical multi...
Among the various phenomena that can be modeled by Boolean networks, i.e., discrete-time dynamical s...
Tensors are multi-way generalizations of matrices, and similarly to matrices, they can also be facto...
Current data processing tasks often involve manipulation of multi-dimensional ob-jects- tensors. In ...
special session "Tensor Computations in Linear and Multilinear Algebra"Tensor decompositions permit ...
In numerical multilinear algebra important progress has recently been made. It has been recognized t...
This thesis introduces a multilinear algebraic framework for computer graphics, computer vision, and...
International audienceWe propose an algorithm to perform the low-rank Boolean Canonical Polyadic Dec...
A simple way to generate a Boolean function in n variables is to take the sign of some polynomial. S...
Current methods capable of processing tensor objects in their natural higher-order structure have be...
We apply tensor rank-one decompositionnto conditional probability tables representing Boolean functi...
We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompositi...
We apply tensor rank-one decomposition (Savicky and Vomlel, 2005) to conditional probability tables ...
We apply tensor rank-one decomposition (Savicky and Vomlel, 2005) to conditional probability tables ...
This work is dedicated to the study of boolean decompositions of binary multidimensional arrays usin...
session speciale "Numerical multilinear algebra: a new beginning"We will discuss how numerical multi...
Among the various phenomena that can be modeled by Boolean networks, i.e., discrete-time dynamical s...
Tensors are multi-way generalizations of matrices, and similarly to matrices, they can also be facto...
Current data processing tasks often involve manipulation of multi-dimensional ob-jects- tensors. In ...
special session "Tensor Computations in Linear and Multilinear Algebra"Tensor decompositions permit ...
In numerical multilinear algebra important progress has recently been made. It has been recognized t...
This thesis introduces a multilinear algebraic framework for computer graphics, computer vision, and...
International audienceWe propose an algorithm to perform the low-rank Boolean Canonical Polyadic Dec...
A simple way to generate a Boolean function in n variables is to take the sign of some polynomial. S...
Current methods capable of processing tensor objects in their natural higher-order structure have be...
We apply tensor rank-one decompositionnto conditional probability tables representing Boolean functi...
We give a robust version of the celebrated result of Kruskal on the uniqueness of tensor decompositi...
We apply tensor rank-one decomposition (Savicky and Vomlel, 2005) to conditional probability tables ...
We apply tensor rank-one decomposition (Savicky and Vomlel, 2005) to conditional probability tables ...
This work is dedicated to the study of boolean decompositions of binary multidimensional arrays usin...