Results 1  10
of
1,931,519
MIMO Linear Equalization With an H
"... Abstract—In this paper, we study the problem of linearly equalizing the multipleinput multipleoutput (MIMO) communications channels from an point of view. estimation theory has been recently introduced as a method for designing filters that have acceptable performance in the face of model uncertai ..."
Abstract
 Add to MetaCart
Abstract—In this paper, we study the problem of linearly equalizing the multipleinput multipleoutput (MIMO) communications channels from an point of view. estimation theory has been recently introduced as a method for designing filters that have acceptable performance in the face of model
Equality of Proofs for Linear Equality
, 2006
"... This paper is about equality of proofs in which a binary predicate formalizing properties of equality occurs, besides conjunction and the constant true proposition. The properties of equality in question are those of a preordering relation, those of an equivalence relation, and other properties appr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
appropriate for an equality relation in linear logic. The guiding idea is that equality of proofs is induced by coherence, understood as the existence of a faithful functor from a syntactical category into a category whose arrows correspond to diagrams. Edges in these diagrams join occurrences of variables
MIMO linear equalization with an criterion
 IEEE Trans. Signal Process
, 2006
"... In this paper we study the problem of linearly equalizing the Multiple Input Multiple Output (MIMO) communications channels from an H ∞ point of view. H ∞ estimation theory has been recently introduced as a method for designing filters that have acceptable performance in the face of model uncertaint ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In this paper we study the problem of linearly equalizing the Multiple Input Multiple Output (MIMO) communications channels from an H ∞ point of view. H ∞ estimation theory has been recently introduced as a method for designing filters that have acceptable performance in the face of model
Automatic Discovery of Linear Restraints Among Variables of a Program
, 1978
"... The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs. ..."
Abstract

Cited by 733 (47 self)
 Add to MetaCart
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.
Linear Equalization Via Factor Graphs
, 2004
"... Abstract — We apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract — We apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs
Optimization of Delay Diversity for Linear Equalization
"... In this paper, we optimize delay diversity (DD) for the case when simple linear equalization (LE) is used at the receiver. We consider the general case of transmission over a correlated multipleinput multipleoutput (MIMO) frequencyselective fading channel. The proposed optimization requires the k ..."
Abstract
 Add to MetaCart
In this paper, we optimize delay diversity (DD) for the case when simple linear equalization (LE) is used at the receiver. We consider the general case of transmission over a correlated multipleinput multipleoutput (MIMO) frequencyselective fading channel. The proposed optimization requires
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Linear pattern matching algorithms
 IN PROCEEDINGS OF THE 14TH ANNUAL IEEE SYMPOSIUM ON SWITCHING AND AUTOMATA THEORY. IEEE
, 1972
"... In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear ti ..."
Abstract

Cited by 549 (0 self)
 Add to MetaCart
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but suboptimal algorithms. In this paper, we introduce an interesting data structure called a bitree. A linear
Lambertian Reflectance and Linear Subspaces
, 2000
"... We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wi ..."
Abstract

Cited by 514 (20 self)
 Add to MetaCart
We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization
, 2007
"... The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative ..."
Abstract

Cited by 568 (23 self)
 Add to MetaCart
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding
Results 1  10
of
1,931,519