Probabilistic inference with noisy-threshold models based on a CP tensor decomposition

JOURNAL ARTICLE published June 2014 in International Journal of Approximate Reasoning

Research funded by Czech Science Foundation (13-20012S,102/09/1278)

Authors: Jiří Vomlel | Petr Tichavský

Generalizations of the noisy-or model

JOURNAL ARTICLE published 24 August 2015 in Kybernetika

Authors: Jiří Vomlel

Poset-valued preference relations

JOURNAL ARTICLE published 28 November 2015 in Kybernetika

Authors: Vladimír Janiš | Susana Montes | Branimir Šešelja | Andreja Tepavčević

An Approximate Tensor-Based Inference Method Applied to the Game of Minesweeper

BOOK CHAPTER published 2014 in Probabilistic Graphical Models

Authors: Jiří Vomlel | Petr Tichavský

Distributed event-triggered algorithm for optimal resource allocation of multi-agent systems

JOURNAL ARTICLE published 22 December 2017 in Kybernetika

Authors: Weiyong Yu | Zhenhua Deng | Hongbing Zhou | Xianlin Zeng

Face Recognition by Discriminative Orthogonal Rank-one Tensor Decomposition

BOOK CHAPTER published 1 June 2008 in Recent Advances in Face Recognition

Authors: Gang Hua

One-sample Rank Order Tests

BOOK CHAPTER published April 2007 in Nonparametric Inference

Symmetric Tensor Canonical Polyadic Decomposition Via Probabilistic Inference

PROCEEDINGS ARTICLE published 20 June 2022 in 2022 IEEE 12th Sensor Array and Multichannel Signal Processing Workshop (SAM)

Research funded by NSFC (62001309)

Authors: Xinyun Hua | Siyuan Li | Lei Cheng

Probabilistic Tensor Train Decomposition with Automatic Rank Determination from Noisy Data

PROCEEDINGS ARTICLE published 11 July 2021 in 2021 IEEE Statistical Signal Processing Workshop (SSP)

Authors: Le Xu | Lei Cheng | Ngai Wong | Yik-Chung Wu

Rank-one tensor injection: A novel method for canonical polyadic tensor decomposition

PROCEEDINGS ARTICLE published March 2016 in 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

Authors: Anh-Huy Phan | Petr Tichavsky | Andrzej Cichocki

Figure 2—figure supplement 1. Denoising with tensor decomposition.

COMPONENT published

A bound for the rank-one transient of inhomogeneous matrix products in special case

JOURNAL ARTICLE published 4 March 2019 in Kybernetika

Authors: Arthur Kennedy-Cochran-Patrick | Sergeĭ Sergeev | Štefan Berežný

Robust Low-Rank and Sparse Tensor Decomposition for Low-Rank Tensor Completion

PROCEEDINGS ARTICLE published 22 May 2021 in 2021 33rd Chinese Control and Decision Conference (CCDC)

Research funded by National Natural Science Foundation of China (61866033) | Fundamental Research Funds for the Central Universities of Northwest Minzu University (31920200097,31920200064) | Natural Science Foundation of Gansu Province (18JR3RA369) | Introduction of Talent Research Project of Northwest Minzu University (xbmuyjrc201904)

Authors: Yuqing Shi | Shiqiang Du | Weilan Wang

Infinite probabilistic secret sharing

JOURNAL ARTICLE published 29 May 2023 in Kybernetika

Authors: Laszlo Csirmaz

Compact representation of multidimensional data using tensor rank-one decomposition

PROCEEDINGS ARTICLE published 2004 in Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.

Authors: N. Ahuja

Low Rank Reduced Biquaternion Tensor Ring Decomposition and Tensor Completion

POSTED CONTENT published

Authors: Hui Luo | Xin Liu | Wei Liu | Yang Zhang

Figure 2: A example of a rank-one tensor.

COMPONENT published

Probabilistic Rank-One Tensor Analysis With Concurrent Regularizations

JOURNAL ARTICLE published July 2021 in IEEE Transactions on Cybernetics

Research funded by National Natural Science Foundation of China (61672444,61272366)

Authors: Yang Zhou | Haiping Lu | Yiu-Ming Cheung

Access structures for finding characteristic-dependent linear rank inequalities

JOURNAL ARTICLE published 29 May 2023 in Kybernetika

Authors: Victor Peña-Macias

Secret sharing schemes for ports of matroids of rank 3

JOURNAL ARTICLE published 5 December 2020 in Kybernetika

Authors: Oriol Farràs