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

100 391 (0,276s)

Result

Decomposition of 3D Binary Objects into Rectangular Blocks

the decomposition problem onto a graph-theoretical problem. We show by extensive experiments that the proposed method outperforms the the octree decomposition in terms of the numberIn this paper we propose a novel algorith...

JD - Využití počítačů, robotika a její aplikace

  • 2016
  • D
  • Link
Result

CLOSE-TO-OPTIMAL ALGORITHM FOR RECTANGULAR DECOMPOSITION OF 3D SHAPES

In this paper, we propose a novel algorithm for a decomposition of 3D binary shapes to rectangular blocks. The aim is to minimize the number of blocks transforms the decomposition problem onto a graph-theoretical p...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019
  • Jimp
  • Link
Result

Non-orthogonal tensor diagonalization

polyadic (CP) tensor decomposition, and in certain scenarios they can outperformntraditional CP decomposition methods. Finally, we propose (4) similar algorithms for tensor block diagonalization, which is related to tensor...

Statistics and probability

  • 2017
  • Jimp
  • Link
Result

Krylov-Levenberg-Marquardt Algorithm for Structured Tucker Tensor Decompositions

different constraints. The model includes block-term decomposition or canonical polyadic decomposition as special cases. We propose a very flexible optimization method for the structured Tucker decomposition<...

Electrical and electronic engineering

  • 2021
  • Jimp
  • Link
Result

On the Conditioning of Factors in the SR Decomposition

of a symplectic matrix and an upper J-triangular matrix. This decomposition is not unique in the SR decomposition. In particula we consider two choices leading to the minimization of the condition number of the diagonal blocks<...

BA - Obecná matematika

  • 2016
  • Jx
  • Link
Result

On Low Tree-Depth Decompositions

The theory of sparse structures usually uses tree like structures as building blocks. In the context of sparse/dense dichotomy this role is played by graphs and structures. In more technical terms we survey some of the properties an...

IN - Informatika

  • 2015
  • Jx
  • Link
Result

Technology of operation of a compact energy block based on quick thermal decomposition of organic waste

Application of the result is possible in the pilot plant "Compact energy block based on quick thermal decomposition of organic materials". The result contains the settings of the parameters of this device....

Other agricultural sciences

  • 2023
  • Ztech
Result

Single-Level Partitioning Support in BOOM-II

is that the minimization and decomposition phases are strictly separated; the minimization process is independent on the subsequent decomposition. We propose a method where the two-level minimization is driven by some decomposi...

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

  • 2004
  • D
Result

Refined Morphological Methods of Moment Computation

A new method of moment computation based on decomposition of the object into rectangular blocks is presented. The decomposition is accomplished by means of distance transform. The method is compared with earlier morphologic...

IN - Informatika

  • 2010
  • D
Result

Nearly optimal scaling in the SR decomposition

In this paper we analyze the nearly optimal block diagonal scalings of the rows of one factor and the columns of the other factor in the triangular form of the SR decomposition. The result is a block generalization of the r...

Pure mathematics

  • 2021
  • Jimp
  • Link
  • 1 - 10 out of 100 391