| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651864 | Electronic Notes in Discrete Mathematics | 2014 | 8 Pages |
Abstract
The numerical algorithms for distributed information processing are developed. The underlying idea is a reduction of the original information processing task to a special rank-constrained matrix approximation problem. Its solution is derived. The error analysis and a comparison with the existing approach are provided.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
