Results 1  10
of
5,809
Capacity of multiantenna Gaussian channels
 EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS
, 1999
"... We investigate the use of multiple transmitting and/or receiving antennas for single user communications over the additive Gaussian channel with and without fading. We derive formulas for the capacities and error exponents of such channels, and describe computational procedures to evaluate such form ..."
Abstract

Cited by 2923 (6 self)
 Add to MetaCart
such formulas. We show that the potential gains of such multiantenna systems over singleantenna systems is rather large under independence assumptions for the fades and noises at different receiving antennas.
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Maximum Likelihood Linear Transformations for HMMBased Speech Recognition
 COMPUTER SPEECH AND LANGUAGE
, 1998
"... This paper examines the application of linear transformations for speaker and environmental adaptation in an HMMbased speech recognition system. In particular, transformations that are trained in a maximum likelihood sense on adaptation data are investigated. Other than in the form of a simple bias ..."
Abstract

Cited by 570 (68 self)
 Add to MetaCart
) constrained, which requires the variance transform to have the same form as the mean transform (sometimes referred to as featurespace transforms). Reestimation formulae for all appropriate cases of transform are given. This includes a new and efficient "full" variance transform and the extension
On limits of wireless communications in a fading environment when using multiple antennas
 Wireless Personal Communications
, 1998
"... Abstract. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bitrates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multielement array (M ..."
Abstract

Cited by 2426 (14 self)
 Add to MetaCart
the capacity scales with increasing SNR for a large but practical number, n, of antenna elements at both transmitter and receiver. We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared
On the assessment of surface heat flux and evaporation using large scale parameters
 Mon. Weather Rev
, 1972
"... ABSTRACTIn an introductory review it is reemphasized that the largescale parameterization of the surface fluxes of sensible and latent heat is properly expressed in terms of energetic considerations over land while formulas of the bulk aerodynamic type are most suitable over the sea. A general fra ..."
Abstract

Cited by 357 (0 self)
 Add to MetaCart
ABSTRACTIn an introductory review it is reemphasized that the largescale parameterization of the surface fluxes of sensible and latent heat is properly expressed in terms of energetic considerations over land while formulas of the bulk aerodynamic type are most suitable over the sea. A general
Partitioning Methods for Satisfiability Testing on Large Formulas (Extended Abstract)
"... Methods for partitioning large propositional formulas are investigated, with the goal of producing a set of smaller formulas whose satisfiability can be determined within reasonable time frames by known algorithms. CNF formula partitioning can be viewed as hypergraph partitioning, which has been stu ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Methods for partitioning large propositional formulas are investigated, with the goal of producing a set of smaller formulas whose satisfiability can be determined within reasonable time frames by known algorithms. CNF formula partitioning can be viewed as hypergraph partitioning, which has been
Bethe Ansatz for Quantum Strings
, 2004
"... We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed allloop gauge theory asymptotic Bethe ansatz by add ..."
Abstract

Cited by 281 (16 self)
 Add to MetaCart
We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed allloop gauge theory asymptotic Bethe ansatz
DomainIndependent Extensions to GSAT: Solving Large Structured Satisfiability Problems
 PROC. IJCAI93
, 1993
"... GSAT is a randomized local search procedure for solving propositional satisfiability problems (Selman et al. 1992). GSAT can solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the DavisPutnam proc ..."
Abstract

Cited by 227 (10 self)
 Add to MetaCart
Putnam procedure. GSAT also efficiently solves encodings of graph coloring problems, Nqueens, and Boolean induction. However, GSAT does not perform as well on handcrafted encodings of blocksworld planning problems and formulas with a high degree of asymmetry. We present three strategies that dramatically
Abstractions from Proofs
, 2004
"... The success of model checking for large programs depends crucially on the ability to efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at each control location, it specifies only relationships between current values of variables, and only those which are req ..."
Abstract

Cited by 268 (33 self)
 Add to MetaCart
The success of model checking for large programs depends crucially on the ability to efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at each control location, it specifies only relationships between current values of variables, and only those which
Estimation of effective interresidue contact energies from protein crystal structures: quasichemical approximation
 Macromolecules
, 1985
"... ABSTRACT: Effective interresidue contact energies for proteins in solution are estimated from the numbers of residueresidue contacts observed in crystal structures of globular proteins by means of the quasichemical approximation with an approximate treatment of the effects of chain connectivity. E ..."
Abstract

Cited by 269 (11 self)
 Add to MetaCart
formed in a large number of protein crystal structures reflcct actual differences of interactions among residues, as if there were no significant contribution from the specific amino acid sequence in each protein as well as intraresidue and shortrange interactions. Then, taking account of the effects
Results 1  10
of
5,809