搜索结果: 1-6 共查到“线性代数 complexity”相关记录6条 . 查询时间(0.096 秒)
Simple Bounds for Recovering Low-complexity Models
`1-norm minimization nuclear-norm minimization block-sparsity duality random matrices
2015/6/17
This note presents a unified analysis of the recovery of simple objects from random linear measurements. When the linear functionals are Gaussian, we show that an s-sparse vector in Rn can be efficien...
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields
communication complexity streaming, matrix singularity determinant
2012/12/3
Finding the singularity of a matrix is a basic problem in linear algebra. Chu and Schnitger first considered this problem in the communication complexity model, in which Alice holds the first half of ...
Linear Transceiver Design for Interference Alignment: Complexity and Computation
Linear Transceiver Interference Alignment: Complexity Computation
2010/12/8
Consider a MIMO interference channel whereby each transmitter and receiver are equipped with
multiple antennas. The basic problem is to design optimal linear transceivers (or beamformers) that can ma...
BINARY SEQUENCE WITH PERFECT SPREADING STAIRCASE PROFILE OF LINEAR COMPLEXITY
Linear complexity pseudo-random sequenc
2007/8/7
This paper makes the following investigations. 1. To solve the second open problem proposed by M.Morii and M.Kasahar[1]; 2. To prove the nonexistence of PSSP sequence with the smallest(or biggest) den...
Let \underline{S}=(S,S,…) be a binary random sequence with period N=2~n, where S=(S_0,…,S_(N-1)) is its one period with N independent and uniformly distributed binary random variables. The main result...
LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m)
Linear complexity over Z/(m) uniqueness
2007/8/7
In this note we discuss the annihilating properties of sequences over Z/(m). By considering the linear complexity and the annihilator structure, we derive the uniqueness condition for the minimal poly...