The paper analyzes the options for solving problems of estimating matrices based on taking into account traffic intensity road network. scale task depends level resolution zoning system and network view. An example a simple transport with crossroads is considered

A low-complexity multiple-input multiple-output (MIMO) subspace detection algorithm is proposed. It is based on decomposing a MIMO channel into multiple subsets of decoupled streams that can be detected separately. The new scheme employs triangular decomposition followed by elementary matrix operations to transform the channel into a generalized elementary matrix whose structure matches the sub...

Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes Boolean matrix B, with the number of factors as small as possible. This paper is a continuation of our previous paper where we proved that formal concepts of I are optimal factors for Boolean factor analysis. In particula...

Monoidal width was recently introduced by the authors as a measure of complexity decomposing morphisms in monoidal categories. We have shown that category cospans graphs, and its variants can be used to capture tree width, path branch width. In this paper we study matrices, an extension different open where connectivity information is handled with matrix algebra graphs are composed along edges ...

The epipolar geometry between two uncalibrated views is completely encapsulated in the fundamental matrix. This paper presents analytic procedures for self-calibrating a perspective camera by decomposing the fundamental matrix into (partially) unknown intrinsic parameters and the camera motion under three conditions: (i) A camera with unknown and varying focal length undergoes general motion, (...