All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

70 867 (0,219s)

Result

CUDA Nonnegative Tensor Factorization Library

Nonnegative tensor factorization library, which uses graphical hardware and runs over twenty times faster, than the CPU version. The library can be also used as a Matlab plugin....

JC - Počítačový hardware a software

  • 2009
  • R
Result

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

Canonical polyadic decomposition of tensor is to approximate or express the tensor by sum of rank-1 tensors. When all or almost all components of factor matrices of the tensor are highly collinear, the dec...

BB - Aplikovaná statistika, operační výzkum

  • 2016
  • D
Result

Cramér-Rao-Induced Bounds for CANDECOMP/ PARAFAC Tensor Decomposition

error of factors along a selected dimension of a tensor of an arbitrary dimension and for tensors of arbitrary dimension and rank, where two factor matrices have orthogonal estimates of factor matrices in...

BB - Aplikovaná statistika, operační výzkum

  • 2013
  • Jx
  • Link
Result

Canonical polyadic tensor decomposition with low-rank factor matrices

an algorithm to decompose the tensors into factor matrices of given ranks. Second, we propose an algorithm which can determine the ranks of the factor matricesThis paper proposes a constrained canonical polyadic (CP) t...

Electrical and electronic engineering

  • 2021
  • D
  • Link
Result

CANDECOMP/PARAFAC Decomposition of High-Order Tensors Through Tensor Reshaping

, and they are often not applicable to higher order and relatively large scale tensors. In this paper, by exploiting the uniqueness of CPD and the relation of a tensor in Kruskal form and its unfolded tensor, we propose a f...

BB - Aplikovaná statistika, operační výzkum

  • 2013
  • Jx
  • Link
Result

On contact brackets on the tensor product

We study the behavior of contact brackets on the tensor product of two algebras, in particular, address the question of Martinez and Zelmanov about extension of a contact bracket on the tensor product from the brackets on the f...

Pure mathematics

  • 2022
  • Jimp
  • Link
Result

Reduction theorems for general linear connections

on manifolds and of classical tensor fields can be factorized through the curvature tensors, the tensor fields and their covariant differentials. We generalize this result, on the spaces of linear symmetric connec...

BA - Obecná matematika

  • 2004
  • Jx
Result

Differential invariants of the metric tensor

The problem of finding differential invariants of arbitrary order, depending on the metric tensor, is solved by the factorization method with respect to a proper subgroup of the differential group acting in the space of differential...

BA - Obecná matematika

  • 2000
  • D
Result

A Further Improvement of a Fast Damped Gauss?Newton Algorithm for CANDECOMP-PARAFAC Tensor Decomposition

(also known as Levenberg-Marquart) for the CANDECOMP-PARAFAC (CP) tensor) operations, where N and R is the tensor order and rank, respectively. It is less than-colinear factors appear in several modes simultaneously. Perfo...

BB - Aplikovaná statistika, operační výzkum

  • 2013
  • D
Result

Tensor Completion Through Multiple Kronecker Product Decomposition

We propose a novel decomposition approach to impute missing values in tensor data. The method uses smaller scale multiway patches to model the whole data or a small volume encompassing the observed missing entries. Simulations on color image...

BB - Aplikovaná statistika, operační výzkum

  • 2013
  • D
  • 1 - 10 out of 70 867