• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 90
Next 10 →

1Generalized Signal Alignment: On the Achievable DoF for Multi-User MIMO Two-Way Relay Channels

by Kangqi Liu, Student Member, Meixia Tao, Senior Member
"... Abstract—This paper studies the achievable degrees of freedom (DoF) for multi-user multiple-input multiple-output (MIMO) two-way relay channels, where there are K source nodes, each equipped with M antennas, one relay node, equipped with N antennas, and each source node exchanges independent message ..."
Abstract - Add to MetaCart
MIMO two-way X relay channel, and L-cluster MIMO multiway relay channel. Previous studies mainly considered the achievability of the DoF cut-set bound 2N at the antenna configuration N < 2M by applying signal alignment for network coding. This work aims to investigate the achievability of the Do

Minimum Variance Estimation of a Sparse Vector Within the Linear Gaussian Model: An

by Zvika Ben-haim, Yonina C. Eldar
"... Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterizat ..."
Abstract - Add to MetaCart
Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterization of the RKHS associated with the SLGM, we derive a lower bound on the minimum variance achievable by estimators with a prescribed bias function, including the important special case of unbiased estimation. This bound is obtained via an orthogonal projection of the prescribed mean function onto a subspace of the RKHS associated with the SLGM. It provides an approximation to the minimum achievable variance (Barankin bound) that is tighter than any known bound. Our bound holds for an arbitrary system matrix, including the overdetermined and underdetermined cases. We specialize

1Compressive Demodulation of Mutually Interfering Signals

by Yuejie Chi, Yao Xie, Robert Calderbank
"... Multi-User Detection is fundamental not only to cellular wireless communication but also to Radio-Frequency Identification (RFID) technology that supports supply chain management. The challenge of Multi-user Detection (MUD) is that of demodulating mutually interfering signals, and the two biggest im ..."
Abstract - Add to MetaCart
Multi-User Detection is fundamental not only to cellular wireless communication but also to Radio-Frequency Identification (RFID) technology that supports supply chain management. The challenge of Multi-user Detection (MUD) is that of demodulating mutually interfering signals, and the two biggest

1 Minimum Variance Estimation of a Sparse Vector within the Linear Gaussian Model:

by Alexander Junga (corresponding, Zvika Ben-haimc, Yonina C. Eldard
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Composition du Jury

by Eric Chaumette, Cédric Richard, Professeur Universités, Yannick Berthoumieu, Professeur Universités, Pascal Chevalier Professeur, Pascal Larzabal, Professeur Universités
"... Caractérisation des problèmes conjoints de détection et d'estimation ..."
Abstract - Add to MetaCart
Caractérisation des problèmes conjoints de détection et d'estimation

OF

by James A. Mcgee, James A. Mcgee, James A. Mcgee, M. Kay, Manbir Sodhi, Nasser H. Zawia , 2015
"... This Dissertation is brought to you for free and open access by DigitalCommons@URI. It has been accepted for inclusion in Open Access Dissertations ..."
Abstract - Add to MetaCart
This Dissertation is brought to you for free and open access by DigitalCommons@URI. It has been accepted for inclusion in Open Access Dissertations

von

by Mathematisch-naturwissenschaftlichen Fakultät, Stefan Lange, Prof Dr, Jan-hendrik Olbertz, Prof Dr, Elmar Kulke
"... eingereicht an der ..."
Abstract - Add to MetaCart
eingereicht an der

Proceedings of the 37th Hawaii International Conference on System Sciences- 2004 QoS Evaluation of JMS: An Empirical Approach

by Shiping Chen, Paul Greenfield
"... JMS is an API specification that defines a standard way for Java applications to access messaging services. All JMS products promise good performance and to properly support the QoS attributes specified in the standard, making it hard to choose between them. Customers who want to determine which JMS ..."
Abstract - Add to MetaCart
JMS is an API specification that defines a standard way for Java applications to access messaging services. All JMS products promise good performance and to properly support the QoS attributes specified in the standard, making it hard to choose between them. Customers who want to determine which JMS product best meets their requirements need a simple, effective and fair methodology for evaluating and comparing competing implementations. This paper presents an empirical methodology for evaluating the QoS implementation of a JMS product. We present a number of test scenarios and define metrics for measuring performance and message persistence. We then illustrate this methodology by using it to evaluate two leading JMS products. Our evaluation results show differences between these products in terms of their overall performance and the impact of various QoS attributes. The case study demonstrates that our empirical methodology is an effective and practical way to test the performance of JMS and other messaging systems.

Akademisk avhandling för teknisk doktorsexamen vid

by Kungl Tekniska Högskolan, Kth Tryck , 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract - Add to MetaCart
the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents

TO CODE OR NOT TO CODE

by Présentée À La, Faculté Informatique, Et Communications, Section Des, Systèmes De Communication, Du Grade, De Docteur, Ès Sciences, Prof M. Vetterli, Prof B. Rimoldi, Prof R. Gallager, Prof A. Lapidoth, Prof J. Massey, Prof E. Telatar, Prof S. Verdú, Michael Gastpar, Amos Lapidoth, Jim Ma , 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract - Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:
Next 10 →
Results 1 - 10 of 90
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University