Results 1  10
of
207,450
Complex NearOrthogonal Designs with No Zero Entry
"... Abstract — Zero entries in complex orthogonal designs (CODs) impede their practical implementation. In this paper, a method of obtaining a no zero entry (NZE) code for 2 k+1 antennas whenever a NZE code exists for 2 k antennas is presented. This is achieved with slight increase in the ML decoding co ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract — Zero entries in complex orthogonal designs (CODs) impede their practical implementation. In this paper, a method of obtaining a no zero entry (NZE) code for 2 k+1 antennas whenever a NZE code exists for 2 k antennas is presented. This is achieved with slight increase in the ML decoding
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 736 (22 self)
 Add to MetaCart
The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
likelihood weighting 3.1 The PYRAMID network All nodes were binary and the conditional probabilities were represented by tablesentries in the conditional probability tables (CPTs) were chosen uniformly in the range (0, 1]. 3.2 The toyQMR network All nodes were binary and the conditional probabilities
1 Square Complex Orthogonal Designs with no Zero Entry for any 2 m Antennas
, 812
"... Abstract — Spacetime block codes from square complex orthogonal designs (SCOD) have been extensively studied and most of the existing SCODs contain large number of zeros. The zeros in the designs result in high peaktoaverage power ratio and also impose a severe constraint on hardware implementati ..."
Abstract
 Add to MetaCart
implementation of the code while turning off some of the transmitting antennas whenever a zero is transmitted. Recently, SCODs with no zero entry have been constructed for 2 a transmit antennas whenever a + 1 is a power of 2. Though there exists codes for 4 and 16 transmit antennas with no zero entry
entry
, 2014
"... From roots to fruitsDeveloping communications in a small expertise growth company ..."
Abstract
 Add to MetaCart
From roots to fruitsDeveloping communications in a small expertise growth company
Fast Computation of Low Rank Matrix Approximations
, 2001
"... In many practical applications, given an m n matrix A it is of interest to nd an approximation to A that has low rank. We introduce a technique that exploits spectral structure in A to accelerate Orthogonal Iteration and Lanczos Iteration, the two most common methods for computing such approximat ..."
Abstract

Cited by 165 (5 self)
 Add to MetaCart
such approximations. Our technique amounts to independently sampling and/or quantizing the entries of the input matrix A, thus speeding up computation by reducing the number of nonzero entries and/or the length of their representation. Our analysis s based on observing that both sampling and quantization can
Proof of the alternating sign matrix conjecture
, 1995
"... The number of n × n matrices whose entries are either −1, 0, or 1, whose row and column sums are all 1, and such that in every row and every column the nonzero entries alternate in sign, is proved to be [1!4!... (3n −2)!]/[n!(n+1)!... (2n −1)!], as conjectured by Mills, Robbins, and Rumsey. ..."
Abstract

Cited by 121 (4 self)
 Add to MetaCart
The number of n × n matrices whose entries are either −1, 0, or 1, whose row and column sums are all 1, and such that in every row and every column the nonzero entries alternate in sign, is proved to be [1!4!... (3n −2)!]/[n!(n+1)!... (2n −1)!], as conjectured by Mills, Robbins, and Rumsey.
Results 1  10
of
207,450