• 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 144
Next 10 →

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
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 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 of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer n-sequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.

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
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

1Capacity Theorems for the Fading Interference Channel with a Relay and Feedback Links

by Daniel Zahavi, Ron Dabora
"... Abstract—Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this work we consider simultane-ous application of both co ..."
Abstract - Add to MetaCart
) feedback from both receivers to the relay, (2) feedback from each receiver to the relay and to one of the transmitters (either corresponding or opposite), (3) feedback from one of the receivers to the relay, (4) feedback from one of the receivers to the relay and to one of the transmitters. Our results

unknown title

by unknown authors
"... ACKNOWLEDGMENTS I would like to give many thanks to Dr. Shengli Fu and Dr. Yan Huang as my advi- ..."
Abstract - Add to MetaCart
ACKNOWLEDGMENTS I would like to give many thanks to Dr. Shengli Fu and Dr. Yan Huang as my advi-

1 An Algebraic Approach to Physical-Layer Network Coding

by Chen Feng, Danilo Silva, Frank R. Kschischang
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

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

RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

by Jason Noah Laska , 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract - Add to MetaCart
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sam-pling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs accommodate the otherwise limiting quantizer of conventional ADCs. In this thesis, we consider a different approach to CS ADC by shifting towards lower quantizer bit-depths rather than lower sampling rates. We explore the extreme case where each measurement is quantized to just one bit, representing its sign. We develop a new theoretical framework to analyze this extreme case and develop new algorithms for signal reconstruction from such coarsely quantized measurements. The 1-bit CS framework leads us to scenarios where it may be more appropriate to reduce bit-depth instead of sampling rate. We find that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement

Using BubbleStorm Accepted Master-Thesis from Marcel Lucas

by Assessor Prof Alej, Ro P. Buchmann, Ph. D
"... Hiermit versichere ich, die vorliegende Master-Thesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehö ..."
Abstract - Add to MetaCart
Prüfungsbehörde vorgelegen. Darmstadt, den 17. Mai 2011 (Marcel Lucas) The popularity of Networked Virtual Environments (NVE) increased remarkably in recent years where a plethora of players participate concurrently. Traditional approaches applying the Client/Server pattern swiftly reach their limit in terms

Acknowledgements

by Alejandro Houspanossian, Facultad De Ciencias Exactas , 2006
"... First, I would like to thank to Dimka Karastoyanova and Mariano Cilia for all the fruitful discussions, their guidance and support through the course of this project. Thanks also to Prof. Alejandro Buchmann who sponsored my stay at Technische Universität Darmstadt during the spring of 2004. The spec ..."
Abstract - Add to MetaCart
First, I would like to thank to Dimka Karastoyanova and Mariano Cilia for all the fruitful discussions, their guidance and support through the course of this project. Thanks also to Prof. Alejandro Buchmann who sponsored my stay at Technische Universität Darmstadt during the spring of 2004. The special thanks go to my advisor, Mariano Cilia, who has made all this possible. Finally, I’d like to thank to my family for all these years of support.

AND MATHEMATICAL ENGINEERING

by Madeleine Udell, Professor Lester Mackey , 2015
"... ii ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 144
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