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

Mechanisms with

by Clément M. Gosselin, Jing Wang, Département De Génie Méchanique, Université Laval
"... of-freedom Parallel ..."
Abstract - Add to MetaCart
of-freedom Parallel

1 Approximate Ergodic Capacity of a Class of Fading 2-user 2-hop Networks

by Sang-woon Jeon, Chien-yi Wang, Student Member, Michael Gastpar
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

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

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-

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
that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement

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

READS

by Jacobi Come Full, Heike Fassbender, See Profile, Niloufer Mackey, Heike Faßbender A, D. Steven Mackey B, Niloufer Mackey C , 1999
"... circle: Jacobi algorithms for ..."
Abstract - Add to MetaCart
circle: Jacobi algorithms for

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:

doi:10.1093/comjnl/bxp026 A Digest and Pattern Matching-Based Intrusion Detection Engine

by Zhongqiang Chen, Yuan Zhang, Zhongrong Chen, Alex Delis , 2008
"... Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real-wor ..."
Abstract - Add to MetaCart
Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real-world network traffic is largely legitimate and that telltales manifested by exploits rarely appear in network streams lead us to the proposal of Fingerprinter. This framework integrates fingerprinting and PM methods to rapidly distinguish well-behaved from malicious traffic. Fingerprinter produces concise digests or fingerprints for attack signatures during its programming phase. In its querying phase, the framework quickly identifies attack-free connections by transforming input traffic into its fingerprint space and matching its digest against those of attack signatures. If the legitimacy of a stream cannot be determined by fingerprints alone, our framework uses the Boyer–Moore algorithm to ascertain whether attack signatures appear in the stream. To reduce false matches, we resort to multiple fingerprinting techniques including Bloom–Filter and Rabin–Fingerprint. Experimentation with a prototype and a variety of traces has helped us establish that Fingerprinter significantly accelerates the attack detection process.
Next 10 →
Results 1 - 10 of 48
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